Symmetric ladders

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetric Ladders and G-biliaison

We study the family of ideals generated by minors of mixed size contained in a ladder of a symmetric matrix from the point of view of liaison theory. We prove that they can be obtained from ideals of linear forms by ascending G-biliaison. In particular, they are glicci.

متن کامل

The optimal rubbling number of ladders, prisms and Möbius-ladders

A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices v and w adjacent to a vertex u, and an extra pebble is added at vertex u. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that v...

متن کامل

Ladders for Travelling Salesmen

We introduce a new class of valid inequalities for the symmetric travelling salesman polytope. The family is not of the common handle-tooth variety. We show that these inequalities are all facet-inducing and have Chvv atal rank 2.

متن کامل

Weakly disordered spin ladders

We analyze an anisotropic spin 1/2 two legs ladder in the presence of various type of random perturbations. The generic phase diagram for the pure system, in a way similar to spin one chains, consists of four phases: an Antiferromagnet, a Haldane gap or a Singlet phase (depending on the sign of interchain coupling) and two XY phases designated by XY1 and XY2. The effects of disorder depend cruc...

متن کامل

Ladders Are PSPACE-Complete

In the game of Go, the question of whether a ladder—a method of capturing stones—works, is shown to be PSPACE-complete. Our reduction closely follows that of Lichtenstein and Sipser [LS80], who first showed PSPACE-hardness of Go by letting the outcome of a game depend on the capture of a large group of stones. We achieve greater simplicity by avoiding the need for pipes and crossovers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nagoya Mathematical Journal

سال: 1994

ISSN: 0027-7630,2152-6842

DOI: 10.1017/s0027763000024958