相关论文: Homometry and direct-sum decompositions of lattice…

A finite subset $K$ of $\mathbb{Z}^d$ is said to be lattice-convex if $K$ is the intersection of $\mathbb{Z}^d$ with a convex set. The covariogram $g_K$ of $K\subseteq \mathbb{Z}^d$ is the function associating to each $u \in \integer^d$ the…

Two Delone sets are called homometric when they share the same autocorrelation or Patterson measure. A model set LAMBDA within a given cut and project scheme is a Delone set that is defined through a window W in internal space. The…

The inverse problem of diffraction theory in essence amounts to the reconstruction of the atomic positions of a solid from its diffraction image. From a mathematical perspective, this is a notoriously difficult problem, even in the…

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

An interesting application of the gauge/gravity duality to condensed matter physics is the description of a lattice via breaking translational invariance on the gravity side. By making use of global symmetries, it is possible to do so…

We settle the first unsolved case of a problem of P. M. Gruber, asked by him in 1991, namely, to investigate the homomorphisms from the lattice of convex bodies of ${\mathbb{E}}^c$ to the lattice of convex bodies of ${\mathbb{E}}^d$ for…

Building sets were introduced in the study of wonderful compactifications of hyperplane arrangement complements and were later generalized to finite meet-semilattices. Convex geometries, the duals of antimatroids, offer a robust…

We study intersections of projective convex sets in the sense of Steinitz. In a projective space, an intersection of a nonempty family of convex sets splits into multiple connected components each of which is a convex set. Hence, such an…

Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from…

A spectral sequence calculating the homology groups of some spaces of maps equivariant under compact group actions is described. For the main example, we calculate the rational homology groups of spaces of even and odd maps $S^m \to S^M$,…

A matrix convex set is a set of the form $\mathcal{S} = \cup_{n\geq 1}\mathcal{S}_n$ (where each $\mathcal{S}_n$ is a set of $d$-tuples of $n \times n$ matrices) that is invariant under UCP maps from $M_n$ to $M_k$ and under formation of…

Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…

For a compact convex subset $K $ of a locally convex Hausdorff space, a measurement on $A(K)$ is a finite family of positive elements in $A(K)$ normalized to the unit constant $1_K$, where $A(K)$ denotes the set of continuous real affine…

One of the main questions in the theory of normal surface singularities is to understand the relations between their geometry and topology. The lattice cohomology is an important tool in the study of topological properties of a plumbed…

For a vertex set $S\subseteq V(G)$ in a graph $G$, the {\em distance multiset}, $D(S)$, is the multiset of pairwise distances between vertices of $S$ in $G$. Two vertex sets are called {\em homometric} if their distance multisets are…

The classical theory of regularity of embeddings of compact convex sets was developed in the 1970s, exclusively in the real case, and even there it does not appear to have been stated in its simplest form. We begin by revisiting this…

This paper continues the research of the author on the homology of cubical and semi-cubical sets with coefficients in systems of objects. The main result is the theorem that the homology of cubical sets with coefficients in contravariant…

A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the…

The evaluation of the interaction between objects arranged on a lattice requires the computation of lattice sums. A scenario frequently encountered are systems governed by the Helmholtz equation in the context of electromagnetic scattering…

We investigate metric projections and distance functions referring to convex bodies in finite-dimensional normed spaces. For this purpose we identify the vector space with its dual space by using, instead of the usual identification via the…