Related papers: The CDE property for minuscule lattices
It has been unknown whether Hirota's discrete Korteweg-de Vries equation and the lattice sine-Gordon equation have the consistency around a cube (CAC) property. In this paper, we show that they have the CAC property. Moreover, we also show…
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…
We consider a linear relation which expresses Stanley's chromatic symmetric function for a poset in terms of the chromatic symmetric functions of some closely related posets, which we call the modular law. By applying this in the context of…
Property C stands for completeness of the set of products of solutions to homogeneous linear differential equations. property C is proved in various formulations for Schr\"odinger operators. Many applications of this property to inverse…
The goal of this paper is to study convex lattice sets by the discrete Legendre transform. The definition of the polar of convex lattice sets in $\mathbb{Z}^n$ is provided. It is worth mentioning that the polar of convex lattice sets have…
We prove that a hypothesis of Cassels, Swinnerton-Dyer, recast by Margulis as statement on the action of the diagonal group $A$ on the space of unimodular lattices, is equivalent to several assertions about minimal sets for this action.…
We provide a lattice regularization of all topological defects in minimal models CFTs using RSOS and anyonic spin chains. For defects of type $(1,s)$, we connect our result with the "topological symmetry" initially identified in Fibonacci…
We consider minimal-perimeter lattice animals, providing a set of conditions which are sufficient for a lattice to have the property that inflating all minimal-perimeter animals of a certain size yields (without repetitions) all…
We develop theory for a flattened dipolar Bose-Einstein condensate (BEC) produced by harmonic confinement along one direction. The role of both short-ranged contact interactions and long-ranged dipole-dipole interactions (DDIs) is…
A main goal in lattice theory is the construction of dense lattices. Most of the remarkable dense lattices in small dimensions have an additional symmetry, they are modular, i.e. similar to their dual lattice. Extremal lattices are densest…
Most segmentation losses are arguably variants of the Cross-Entropy (CE) or Dice losses. On the surface, these two categories of losses seem unrelated, and there is no clear consensus as to which category is a better choice, with varying…
The density of zeros of the partition function of the Ising model on a class of treelike lattices is studied. An exact closed-form expression for the pertinent critical exponents is derived by using a couple of recursion relations which…
Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…
We study matching problems in which agents form one side of a bipartite graph and have preferences over objects on the other side. A central solution concept in this setting is popularity: a matching is popular if it is a (weak) Condorcet…
In this paper, we study Artinian and Noetherian properties in vector lattices and provide a concrete representation of these spaces. Furthermore, we describe for which Archimedean uniformly complete vector lattices every decreasing sequence…
For a finite poset $P=(X,\prec)$, let $\mathcal{L}_P$ denote the set of linear extensions of $P$. The sorting probability $\delta(P)$ is defined as \[\delta(P) \, := \, \min_{x,y\in X} \, \bigl| \mathbf{P} \, [L(x)\leq L(y) ] \ - \…
Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…
For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…
We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…
We characterize numerical semigroups for which the poset of its ideal class monoid is a lattice, and study the irreducible elements of such a lattice with respect to union, intersection, infimum and supremum.