Related papers: Semilattice base hierarchy for frames and its topo…
We investigate a family of lattice models with manifest N=2 supersymmetry. The models describe fermions on a 1D lattice, subject to the constraint that no more than k consecutive lattice sites may be occupied. We discuss the special…
We solve the problem of best approximation by Parseval frames to an arbitrary frame in a subspace of an infinite dimensional Hilbert space. We explicitly describe all the solutions and we give a criterion for uniqueness. This best…
Recent interest in point and line node semimetals has led to the proposal and discovery of these phenomena in numerous systems. Frequently, though, these nodal systems are described in terms of individual properties reliant on specific…
We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…
Let $L$ be a full-rank lattice in $\mathbb R^d$ and write $L^+$ for the semigroup of all vectors with nonnegative coordinates in $L$. We call a basis $X$ for $L$ positive if it is contained in $L^+$. There are infinitely many such bases,…
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…
There are two basic ways of weakening the definition of the well-known metric regularity property by fixing one of the points involved in the definition. The first resulting property is called metric subregularity and has attracted a lot of…
The $\gamma$-Cambrian semilattices $\mathcal{C}_{\gamma}$ defined by Reading and Speyer are a family of meet-semilattices associated with a Coxeter group $W$ and a Coxeter element $\gamma\in W$, and they are lattices if and only if $W$ is…
We extend Wallman's classic duality from lattice bases to semilattice subbases and from compact to locally closed compact spaces. Moreover, we make this duality functorial via appropriate relational morphisms.
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
A lattice-type regularization of the supersymmetric field theories on a supersphere is constructed by approximating the ring of scalar superfields by an integer-valued sequence of finite dimensional rings of supermatrices and by using the…
We study separation axioms for $X$-top-lattices (i.e. lattices $L$ for which a given subset $X\subseteq L\backslash \{1\}$ admits a \emph{Zariski-like topology}). Such spaces are $T_{0}$ and usually far away from being $T_{2}.$% We give…
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…
The aim of this article is to use Banach lattice techniques to study coordinate systems in function spaces. We begin by proving that the greedy algorithm of a basis is order convergent if and only if a certain maximal inequality is…
In recent years, non-Hermitian phases in classical and quantum systems have garnered significant attention. In particular, their intriguing band geometry offers a platform for exploring unique topological states and unconventional quantum…
In this paper, we first give the definiton of a vertex superalgebroid. Then we construct a family of vertex superalgebras associated to vertex superalgebroids. As a main result, we find a sufficient and necessary condition that this vertex…
Supersymmetric lattice Ward-Takahashi identities are investigated perturbatively up to two-loop corrections for super doubler approach of $N=2$ lattice Wess-Zumino models in 1- and 2-dimensions. In this approach notorious chiral fermion…
We study percolation problems of overlapping objects where the underlying geometry is such that in D-dimensions, a subset of the directions has a lattice structure, while the remaining directions have a continuum structure. The resulting…
Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…
The "Hermitizability" problem of quantum theory is explained, discussed and illustrated via the discrete-lattice cryptohermitian quantum graphs. In detail, the description of the domain ${\cal D}$ of admissible parameters is provided for…