English
Related papers

Related papers: Finite diamond-colored modular and distributive la…

200 papers

We study some distributive lattices arising in the combinatorics of lattice paths. In particular, for the Dyck, Motzkin and Schroder lattices we describe the spectrum and we determine explicitly the Euler characteristic in terms of natural…

Combinatorics · Mathematics 2009-05-26 Luca Ferrari , Emanuele Munarini

Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by…

Rings and Algebras · Mathematics 2008-12-03 Klaus Denecke , Jorg Koppitz , Slavcho Shtrakov

A new set of exact scattering matrices in 1+1 dimensions is proposed by solving the bootstrap equations. Extending earlier constructions of colour valued scattering matrices this new set has its colour structure associated to non…

High Energy Physics - Theory · Physics 2009-10-31 Christian Korff

Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure.…

Data Structures and Algorithms · Computer Science 2016-03-24 Patrizio Angelini , Michael A. Bekos , Michael Kaufmann , Vincenzo Roselli

In this paper, a subclass of bounded distributive lattices, that is, finitely disjunctive distributive lattices (FDD-lattices) have been introduced. Then we apply it to establish a Stone duality for Lawson compact algebraic L-domains.…

General Topology · Mathematics 2026-02-16 Huijun Hou , Ao Shen

We use the combinatorial properties of central sets to prove a result about the existence of exponential monochromatic patterns, in the style of Hindman's Finite Sums Theorem. More precisely, we prove that for every finite coloring of the…

Combinatorics · Mathematics 2022-11-30 Mauro Di Nasso , Mariaclara Ragosta

An equivalence between generalised restricted solid-on-solid (RSOS) models, associated with sets of graphs, and multi-colour loop models is established. As an application we consider solvable loop models and in this way obtain new solvable…

High Energy Physics - Theory · Physics 2009-10-22 Ole Warnaar , Bernard Nienhuis

We develop layered monoidal theories -- a generalisation of monoidal theories combining formal descriptions of a system at different levels of abstraction. Via their representation as string diagrams, monoidal theories provide a graphical…

Logic in Computer Science · Computer Science 2026-02-24 Leo Lobski , Fabio Zanasi

We study random coloring of the hexagons of a honeycomb lattice into $2^{n-1}$ colors (that is the standard Potts model at infinite temperature). It may be considered as a generalization of percolation to $n$ pairwise independent, but…

Mathematical Physics · Physics 2019-09-02 Mikhail Fedorov

The following thesis contains results on the combinatorial representation theory of the finite Hecke algebra $H_n(q)$. In Chapter 2 simple combinatorial descriptions are given which determine when a Specht module corresponding to a…

Combinatorics · Mathematics 2009-06-09 Chris Berg

Flat-band models have been of particular interest from both fundamental aspects and realization in materials. Beyond the canonical examples such as Lieb lattices and line graphs, a variety of tight-binding models are found to possess flat…

Materials Science · Physics 2021-08-05 Tomonari Mizoguchi , Hosho Katsura , Isao Maruyama , Yasuhiro Hatsugai

The class of generalized Lie-type color algebras contains the ones of generalized Lie-type algebras, of $n$-Lie algebras and superalgebras, commutative Leibniz $n$-ary algebras and superalgebras, among others. We focus on the class of…

Rings and Algebras · Mathematics 2020-04-03 Elisabete Barreiro , Antonio Jesús Calderón , Ivan Kaygorodov , José María Sánchez

The distributed coloring problem is at the core of the area of distributed graph algorithms and it is a problem that has seen tremendous progress over the last few years. Much of the remarkable recent progress on deterministic distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-10-06 Marc Fuchs , Fabian Kuhn

The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-12-24 Mohsen Ghaffari , Juho Hirvonen , Fabian Kuhn , Yannic Maus , Jukka Suomela , Jara Uitto

Finite distributive lattices whose join-meet ideals are of K\"onig type will be classified. Furthermore, a class of polyominoes whose polyomino ideals are of K\"onig type will be studied.

Commutative Algebra · Mathematics 2022-02-22 Jürgen Herzog , Takayuki Hibi

A recent theorem of [GGSM1] showed that adjoint orbits of semisimple Lie algebras have the structure of symplectic Lefschetz fibrations. We investigate the behaviour of their fibrewise compactifications. Expressing adjoint orbits and fibres…

Algebraic Geometry · Mathematics 2016-08-23 Edoardo Ballico , Brian Callander , Elizabeth Gasparim

In this paper using the connections between some subvarieties of residuated lattices, we investigated some properties of the lattice of ideals in commutative and unitary rings. We give new characterizations for commutative rings $A$ in…

Rings and Algebras · Mathematics 2022-11-28 Cristina Flaut , Dana Piciu

We report room temperature lasing in two-dimensional diffractive lattices of silver and gold plasmon particle arrays embedded in a dye-doped polymer that acts both as waveguide and gain medium. As compared to conventional dielectric…

Optics · Physics 2014-09-26 A. Hinke Schokker , A. Femius Koenderink

In this paper we introduce and study a variety of algebras that properly includes integral distributive commutative residuated lattices and weak Heyting algebras. Our main goal is to give a characterization of the principal congruences in…

Logic · Mathematics 2018-04-20 Ramon Jansana , Hernan Javier San Martin

K\H{o}nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized K\H{o}nig's theorem to a framework…

Combinatorics · Mathematics 2024-02-01 Ryuhei Mizutani