Related papers: Danzer's configuration revisited

This paper studies representation stability in the sense of Church and Farb for representations of the symmetric group $S_n$ on the cohomology of the configuration space of $n$ ordered points in $\mathbf{R}^d$. This cohomology is known to…

It is an intriguing question to see what kind of information on the structure of an oriented graph $D$ one can obtain if $D$ does not contain a fixed oriented graph $H$ as a subgraph. The related question in the unoriented case has been an…

We propose an unexpected twist to description of the geometry and topology of configurations of n straight lines considered as a whole 3D entity (because the lines are inseparably linked pairwise while having linking numbers 1/2 or -1/2)…

We describe computational results about undirected graphs having $10$ vertices and automorphism group isomorphic to $\mathbb{Z}/4\mathbb{Z}$.

Absolute Parallelism (AP) has many interesting features: large symmetry group of equations; field irreducibility with respect to this group; vast list of consistent second order equations not restricted to Lagrangian ones. There is the…

We consider Legendrian contact structures on odd-dimensional complex analytic manifolds. We are particularly interested in integrable structures, which can be encoded by compatible complete systems of second order PDEs on a scalar function…

It is shown that the infinite dimensional critical surface of general euclidean lattice actions in a generic four-dimensional scalar field theory with $\Phi^4$ interactions has a domain of special multicritical points where higher…

We study the reconfiguration of odd matchings of combinatorial graphs. Odd matchings are matchings that cover all but one vertex of a graph. A reconfiguration step, or flip, is an operation that matches the isolated vertex and,…

Let $P = (\{1,2,\ldots,n,\leq)$ be a poset that is an union of disjoint chains of the same length and $V=\mathbb{F}_q^N$ be the space of $N$-tuples over the finite field $\mathbb{F}_q$. Let $V_i = \mathbb{F}_q^{k_i}$, $1 \leq i \leq n$, be…

We present a computational methodology for obtaining rotationally symmetric sets of points satisfying discrete geometric constraints, and demonstrate its applicability by discovering new solutions to some well-known problems in…

Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. We observe that there exist Apollonian packings which have strong integrality properties, in which…

Let G be a connected complex simple Lie group with maximal compact subgroup U. Let g be the Lie algebra of G, and X = G/U be the associated Riemannian globally symmetric space of type IV. We have constructed three types of arithmetic…

Let $D$ be a connected oriented graph. A set $S \subseteq V(D)$ is convex in $D$ if, for every pair of vertices $x, y \in S$, the vertex set of every $xy$-geodesic, ($xy$ shortest directed path) and every $yx$-geodesic in $D$ is contained…

We construct supergravity backgrounds representing non-homogeneous compactifications of d=10,11 supergravities to four dimensions, which cannot be written as a direct product. The geometries are regular and approach $AdS_7\times S^4$ or…

We provide a step towards classifying Riemannian four-manifolds in which the curvature tensor has zero divergence, or -- equivalently -- the Ricci tensor Ric satisfies the Codazzi equation. Every known compact manifold of this type belongs…

An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…

We construct two families of Dantzig figures, which are $(d,2d)$-polytopes with an antipodal vertex pair, from convex hulls of initial subsets for the graded lexicographic (grlex) and graded reverse lexicographic (grevlex) orders on…

Suppose $\Gamma$ is a finite simple graph. If $D$ is a dominating set of $\Gamma$ such that each $x\in D$ is contained in the set of vertices of an odd cycle of $\Gamma$, then we say that $D$ is an odd dominating set for $\Gamma$. For a…

All the supersymmetric configurations of pure, ungauged, N=4,d=4 supergravity are classified in a formalism that keeps manifest the S and T dualities of the theory. We also find simple equations that need to be satisfied by the…

An $(n_3)$ configuration is an incidence structure equivalent to a linear hypergraph on $n$ vertices which is both 3-regular and 3-uniform. We investigate a variant in which one constraint, say 3-regularity, is present, and we allow exactly…