相关论文: Finite diamond-colored modular and distributive la…
A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-chromatic number of a graph is the minimum number of colors…
We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the…
We use the Mallows permutation model to construct a new family of stationary finitely dependent proper colorings of the integers. We prove that these colorings can be expressed as finitary factors of i.i.d. processes with finite mean coding…
Every lattice is isomorphic to a lattice whose elements are sets of sets, and whose operations are intersection and an operation extending the union of two sets of sets A and B by the set of all sets in which the intersection of an element…
We construct colored lattice models whose partition functions represent symplectic and odd orthogonal Demazure characters and atoms. We show that our lattice models are not solvable, but we are able to show the existence of sufficiently…
Despite the fact that some vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not "under control" from a polyhedral point of view. The equivalence between \emph{optimization} and…
This paper is, essentially, a survey related to the problem of understanding the combinatorics of the action of the monoidal category of finite dimensional modules over a simple finite dimensional Lie algebra on various categories of Lie…
We present a ``reasonable'' statement about Lie algebras that is equivalent to the Four Color Theorem. The notions appearing in the statement also appear in the theory of finite-type invariants of knots (Vassiliev invariants) and…
We prove that the universal theory and the quasi-equational theory of bounded residuated distributive lattice-orderegroupoids are both EXPTIME-complete. Similar results areproven for bounded distributive lattices with a unary or binary…
Congruence lattices of semiprime algebras from semi--degenerate congruence--modular varieties fulfill the equivalences from B. A. Davey`s well--known characterization theorem for $m$--Stone bounded distributive lattices, moreover, changing…
We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the…
Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…
Let $p$ be a prime. Given a split semisimple group scheme $G$ over a normal integral domain $R$ which is a faithfully flat $\mathbb Z_{(p)}$-algebra, we classify all finite dimensional representations $V$ of the fiber $G_K$ of $G$ over…
Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…
A previous article was devoted to an analysis of the symmetry properties of a class of first-order delay ordinary differential systems (DODSs). Here we concentrate on linear DODSs. They have infinite-dimensional Lie point symmetry groups…
Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…
In this paper, we transfer Davey`s characterization for $\kappa $--Stone bounded distributive lattices to lattices with certain kinds of quotients, in particular to commutator lattices with certain properties, and obtain related results on…
We present an analytical method of studying "extended" electronic eigenstates of a diamond hierarchical lattice, which may be taken as the simplest of the hierarchical models recently proposed for stretched polymers. We use intuitive…
This paper studies the combinatorics of lattice congruences of the weak order on a finite Weyl group $W$, using representation theory of the corresponding preprojective algebra $\Pi$. Natural bijections are constructed between important…
Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits multiple bases. Among these, the canonical base, the canonical…