Related papers: Lattice Diagram polynomials in one set of variable…

We give a rational form of a generic two-dimensional "quad" map, containing the so-called $Q_4$ case, but whose coefficients are free. Its integrability is proved using the calculation of algebraic entropy.

We propose some analogue of the Narain lattice for CHL string. The symmetries of this lattice are the symmetries of the perturbative spectrum. We explain in this language the known results about the possible gauge groups in compactified…

We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…

The Weyl relations, the harmonic oscillator, the hydrogen atom, the Dirac equation on the lattice are presented with the help of the difference equations and the orthogonal polynomials of discrete variable. This area of research is…

Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

We study the subdivision properties of certain lattice gauge theories based on the groups $Z_{2}$ and $Z_{3}$, in four dimensions. The Boltzmann weights are shown to be invariant under all type $(k,l)$ subdivision moves, at certain discrete…

We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.

In this work, we study the interlace polynomial as a generalization of a graph invariant to delta-matroids. We prove that the interlace polynomial satisfies the four-term relation for delta-matroids and determines thus a finite type…

Let (L_i : i\in I) be a family of lattices in a nontrivial lattice variety V, and let \phi_i: L_i --> M, for i\in I, be isotone maps (not assumed to be lattice homomorphisms) to a common lattice M (not assumed to lie in V). We show that the…

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

We explicitly describe the Lie algebras $M_L$ of ladder matrices in $M_n$ associate with dominant upper triangular ladders $L$, and completely characterize the derivations of these $M_L$ over a field $F$ with $char(F) \neq 2$. We also…

We provide a direct proof that a finite graded lattice with a maximal chain of left modular elements is supersolvable. This result was first established via a detour through EL-labellings in [McNamara-Thomas] by combining results of…

In Lett. Math. Phys. 114, 54 (2024) and 115, 70 (2025), the author introduces what is presented as a novel method for determining whether a sequence of orthogonal polynomials is "classical", based solely on its initial recurrence…

We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…

This work studies the remarkable relationships that hold among certain m-tuples of the Garsia-Haiman modules $ {\bf M}_\mu$ and corresponding elements of the Macdonald basis. We recall that ${\bf M}_\mu$ is defined for a partition $\mu\part…

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

Let $M$ be a matroid without loops or coloops and let $T(M;x,y)$ be its Tutte polynomial. In 1999 Merino and Welsh conjectured that $$\max(T(M;2,0), T(M;0,2))\geq T(M;1,1)$$ holds for graphic matroids. Ten years later, Conde and Merino…