Related papers: A rectangular interval of a rectangular lattice is…

We have determined the rescaling of the scalar condensate $Z\equiv Z_\phi$ near the critical line of a 4D Ising model. Our lattice data, supporting previous numerical indications, confirm the behaviour $Z_\phi\sim \ln ({\rm cutoff})$. This…

In this paper we investigate the class of rigid monomial ideals. We give a characterization of the minimal free resolutions of certain classes of these ideals. Specifically, we show that the ideals in a particular subclass of rigid monomial…

Proctor's work on staircase plane partitions yields an enumeration of lozenge tilings of a halved hexagon on the triangular lattice. Rohatgi later extended this tiling enumeration to a halved hexagon with a triangle cut off from the…

If a partition of a lattice in R^d is selfsimilar, it is called lattice substitution system (LSS). Such sets represent nonperiodic, but highly ordered structures. An important property of such structures is, whether they are model sets or…

Let $A$ be a tubular algebra and let $r$ be a positive irrational. Let ${\mathcal D}_r$ be the definable subcategory of $A$-modules of slope $r$. Then the width of the lattice of pp formulas for ${\mathcal D}_r$ is $\infty$. It follows that…

Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…

Given a euclidean lattice and a curve in the corresponding projective space, our goal is to relate the height of the curve to the successive minima of the lattice. The proof of such a statement in http://hal.archves-ouvertes.vf/hal-00270564…

For fixed coprime polynomials $U,V \in \mathbb{F}_q [T]$ with degrees of different parities, and a general polynomial $A \in \mathbb{F}_q [T]$, define the arithmetic function $S_{U,V} (A)$ to be the number of representations of $A$ of the…

We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

Let $G$ be a semisimple real algebraic Lie group of real rank at least two and $U$ be the unipotent radical of a non-trivial parabolic subgroup. We prove that a discrete Zariski dense subgroup of $G$ that contains an irreducible lattice of…

Let $\mathcal{M}=\{m_\lambda\}_{\lambda\in\Lambda}$ be a separating family of lattice seminorms on a vector lattice $X$, then $(X,\mathcal{M})$ is called a multi-normed vector lattice (or MNVL). We write $x_\alpha \xrightarrow{\mathrm{m}}…

Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the…

Let $G$ be a real centre-free semisimple Lie group without compact factors. I prove that irreducible lattices in $G$ are rigid under two types of sublinear distortions. The first result is that the class of lattices in groups that do not…

A planar semimodular lattice $K$ is \emph{slim} if $\mathsf{M}_{3}$ is not a sublattice of~$K$. In a recent paper, G. Cz\'edli found four new properties of congruence lattices of slim, planar, semimodular lattices, including the \emph{No…

The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where…

We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…

The operation of replacing every vertex of an $r$-regular lattice $H$ by a complete graph of order $r$ is called clique-inserting, and the resulting lattice is called the clique-inserted-lattice of $H$. For any given $r$-regular lattice,…

A monotonous polyomino is formed by all lattice unit squares met by the graph of some fixed monotonous continuous function $f:[a,b] \to \mathbb{R}$ with $f(k) \notin \mathbb{Z}$ whenever $k \in \mathbb{Z}$. Our main result says that the…

It is an easy observation that every residuated lattice is in fact a semiring because multiplication distributes over join and the other axioms of a semiring are satisfied trivially. This semiring is commutative, idempotent and simple. The…