Related papers: Note on antichain cutsets in discrete semimodular …
A planar semimodular lattice $L$ is \emph{slim} if $\mathbf{M}_3$ is not a sublattice of $L$. In a recent paper, G. Cz\'edli introduced a very powerful diagram type for slim, planar, semimodular lattices. This short note proves the…
We extend the theory of atomized semilattices to the infinite setting. We show that it is well-defined and that every semilattice is atomizable. We also study atom redundancy, focusing on complete and finitely generated semilattices and…
We study the properties of topological defects in the lattice compact Abelian Higgs Model with charge Q=2 matter field. We find that monopoles and antimonopoles form chain-like structures which are dense in the confinement/symmetric phase.…
Building on classical theorems of Sperner and Kruskal-Katona, we investigate antichains $\mathcal F$ in the Boolean lattice $B_n$ of all subsets of $[n]:=\{1,2,\dots,n\}$, where $\mathcal F$ is flat, meaning that it contains sets of at most…
In this paper we define, inspired by ring theory, the class of maximal residuated lattices with lifting Boolean center and prove a structure theorem for them: any maximal residuated lattice with lifting Boolean center is isomorphic to a…
We show that in high dimensions the set of stable lattices is almost of full measure in the space of unimodular lattices.
In the present work, we study dark solitons in dynamical lattices with the saturable nonlinearity and compare them with those in lattices with the cubic nonlinearity. This comparison has become especially relevant in light of recent…
We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are…
For integers $0 \leq m \leq l \leq n-m$, the truncated Boolean lattice ${\cal B}_n(m,l)$ is the poset of all subsets of $[n] = \{1, 2, \ldots, n\}$ which have size at least $m$ and at most $l$. ${\cal C} \subseteq {\cal B}_n(m,l)$ is a {\em…
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…
Answering several questions of Duffus, Frankl and R\"odl, we give asymptotics for the logarithms of (i) the number of maximal antichains in the n-dimensional Boolean algebra and (ii) the numbers of maximal independent sets in the covering…
Resonant mode interactions in weakly nonlinear multi-dimensional lattices and related effects are described. We concentrate on formal description of the phenomenon and consider as examples mode interactions and evolution equations for…
We study the existence and the distribution of "long" chains in the Weihrauch degrees, mostly focusing on chains with uncountable cofinality. We characterize when such chains have an upper bound and prove that there are no cofinal chains…
We provide a geometrical characterization of extremal negative dependence as a convex polytope in the simplex of multidimensional Bernoulli distributions, and we prove that it is an antichain that satisfies some minimality conditions with…
Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes…
The methods to classify extremal unimodular lattices with given automorphisms are extended to the situation of modular lattices. A slightly more general notion than the type from the PhD thesis of Michael Juergens is the det-type. The…
We obtain weight functions associated with $q$-linear and $q$-quadratic lattices that yield discrete orthogonality with respect to a quasi-definite moment functional for the Askey-Wilson polynomials and all the polynomial sequences in the…
Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as Dilworth's lattices in 1940, and many alternative definitions and equivalent concepts have been discovered or rediscovered since…
In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…