相关论文: Bases in Systems of Simplices and Chambers

This is the second in a pair of articles that classify the configuration space and kinematic symmetry groups for $N$ identical particles in one-dimensional traps experiencing Galilean-invariant two-body interactions. These symmetries…

We present a simple criterion for solvability of lattice spin systems on the basis of the graph theory and the simplicial homology. The lattice systems satisfy algebras with graphical representations. It is shown that the null spaces of…

We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…

Let $\Gamma$ be a group which is virtually free of rank at least 2 and let $\mathcal{F}_{td}(\Gamma)$ be the family of totally disconnected, locally compact groups containing $\Gamma$ as a co-compact lattice. We prove that the values of the…

An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…

The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

One of the primary methods of studying the topology of configurations of points in a graph and configurations of disks in a planar region has been to examine discrete combinatorial models arising from the underlying spaces. Despite the…

We study $n$-dimensional matrices with $\{0,1\}$-entries ($n$-cubes) such that all their $2$-dimensional slices are incidence matrices of symmetric designs. A known construction of these objects obtained from difference sets is generalized…

We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…

To each complex reflection group $\Gamma$ one can attach a canonical symplectic singularity $\mathcal{M}_\Gamma$ arXiv:math/9903070. Motivated by the 4D/2D duality arXiv:1312.5344, arXiv:1707.07679, Bonetti, Meneghelli and Rastelli…

A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diagonal entries $\pm 1$ satisfying $CC^\top=(n-1)I$. If $C$ is symmetric, then $C$ has a symmetric spectrum $\Sigma$ (that is,…

In his PhD thesis, Abrams proved that, for a natural number n and a graph G with at least n vertices, the n-strand configuration space of G deformation retracts to a compact subspace, the discretized n-strand configuration space, provided G…

A new construction of decomposition smoothness spaces of homogeneous type is considered. The smoothness spaces are based on structured and flexible decompositions of the frequency space $\mathbb{R}^d\backslash\{0\}$. We construct simple…

In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…

We consider the construction of point processes from tilings, with equal volume tiles, of d-dimensional Euclidean space. We show that one can generate, with simple algorithms ascribing one or more points to each tile, point processes which…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

A square matrix $M$ represents a graph $\Gamma$ if its nonzero off-diagonal entries encode the adjacencies of $\Gamma$, subject to a fixed ordering of the vertices. Over the field of two elements, we investigate the distribution of ranks in…

We analyze the behavior of a non-Hermitian opened one-dimensional quantum system with $\mathcal{PT}$ symmetry. This system is built by a dimer, with balanced gains and losses described by a parameter $\gamma$. By varying $\gamma$ the system…