相关论文: Higher Lawrence configurations

Minimal Markov bases of configurations of integer vectors correspond to minimal binomial generating sets of the assocciated lattice ideal. We give necessary and sufficient conditions for the elements of a minimal Markov basis to be (a)…

We review various combinatorial applications of field theoretical and matrix model approaches to equilibrium statistical physics involving the enumeration of fixed and random lattice model configurations. We show how the structures of the…

We study lattices in free abelian groups of infinite rank that are invariant under the action of the infinite symmetric group, with emphasis on finiteness of their equivariant bases. Our framework provides a new method for proving…

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

This is a short note on various results about the combinatorial properties of line arrangements in terms of the Chern numbers of the corresponding log surfaces. This resembles the study of the geography of surfaces of general type. We prove…

We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in general dynamical systems, both invertible and…

The generalized knots-quivers correspondence extends the original knots-quivers correspondence, by allowing higher level generators of quiver generating series. In this paper we explore the underlined combinatorics of such generating…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

We show that the well known {\em homotopy complementation formula} of Bj\"orner and Walker admits several closely related generalizations on different classes of topological posets (lattices). The utility of this technique is demonstrated…

Let C be the set of all possible quantum states. We study the convex subsets of C with attention focused on the lattice theoretical structure of these convex subsets and, as a result, find a framework capable of unifying several aspects of…

We determine an explicit Gr\"obner basis, consisting of linear forms and determinantal quadrics, for the prime ideal of Raftery's mixture transition distribution model for Markov chains. When the states are binary, the corresponding…

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

We find an explicit combinatorial gradient vector field on the well known complex S (Salvetti complex) which models the complement to an arrangement of complexified hyperplanes. The argument uses a total ordering on the facets of the…

We present a class of lattices in R^d (d >= 2) which we call GL-lattices and conjecture that any lattice is such. This conjecture is referred to as GLC. Littlewood's conjecture amounts to saying that Z^2 is GL. We then prove existence of GL…

The purpose of this paper is to construct a generalized r-matrix structure of finite dimensional systems and an approach to obtain the algebro-geometric solutions of integrable nonlinear evolution equations (NLEEs). Our starting point is a…

We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Infinite hyperplane arrangements whose vertices form a lattice are studied from the point of view of commutative algebra. The quotient of such an arrangement modulo the lattice action represents the minimal free resolution of the associated…