Related papers: Polycyclic Geometric Realizations of the Gray Conf…
A $configuration$ of a linkage $\Gamma$ is a possible positioning of $\Gamma$ in $\mathbb{R}^d$ and the collection of all such forms the configuration space $\mathcal{C}(\Gamma)$ of $\Gamma$. We here introduce the notion of the $symmetric…
Symmetries play a crucial role in shaping the structure and predictions of multi-Higgs-doublet models. In three-Higgs-doublet models considerable effort has been put into classifying possible symmetry groups and the conditions for their…
We re-examine previously found cosmological solutions to eleven-dimensional supergravity in the light of the E_{10}-approach to M-theory. We focus on the solutions with non zero electric field determined by geometric configurations (n_m,…
We give a classification of ordered five points in $\mathbb P^3$ under the diagonal action of $GL_4$ over an algebraically closed field of characteristic $0$, by an explicit description of the diagonal action of $GL_4$ on the quintuple of…
The cyclic sieving phenomenon was defined by Reiner, Stanton, and White in a 2004 paper. Let X be a finite set, C be a finite cyclic group acting on X, and f(q) be a polynomial in q with nonnegative integer coefficients. Then the triple…
For a positive integer $d$, a connected graph $\Gamma$ is a symmetrical 2-extension of the $d$-dimensional grid $\Lambda^d$ if there exists a vertex-tran\-sitive group $G$ of automorphisms of $\Gamma$ and its imprimitivity system $\sigma$…
In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks - Assur graphs - which arise in the analysis of mechanical linkages. In this paper we further explore the geometric properties of Assur…
Trilinear mappings appear naturally when performing spatial isogeometric discretizations of degree $p = 1$. Among them, birational maps are characterized by the property that both the mapping and the associated inverse map are rational and…
A graphical regular representation (GRR) of a group $G$ is a Cayley graph of $G$ whose full automorphism group is equal to the right regular permutation representation of $G$. Towards a proof of the conjecture that only finitely many finite…
Our starting point is a very simple one, namely that of a set L_4 of four mutually skew lines in PG(7,2): Under the natural action of the stabilizer group G(L_4) < GL(8,2) the 255 points of PG(7,2) fall into four orbits omega_1, omega_2,…
A 3 dimensional analogue of Sakai's theory concerning the relation between rational surfaces and discrete Painlev\'e equations is studied. For a family of rational varieties obtained by blow-ups at 8 points in general position in ${\mathbb…
We present a class of three-dimensional quantum field theories whose ordinary global symmetries mix with higher-form symmetries to form a continuous 2-group. All these models can be obtained by performing a gauging procedure in a parent…
This paper extends graphic statics by describing the forces and moments in any 3D rigid-jointed frame structure in terms of cell complexes using homology theory of algebraic topology. Graphic statics provides a highly geometric way to…
The paper shows the existence of a family of directed strongly regular graphs with parameters (22, 9, 6, 3, 4). The adjacency matrices of the found digraphs are composed of $3\times 3$ circulant blocks. The automorphism group of all the…
We study properties of the realizations of groups as the combinatorial automorphism group of a convex polytope. We show that for any non-abelian group $G$ with a central involution there is a centrally symmetric polytope with $G$ as its…
Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which…
Geometric consistency, i.e. the preservation of neighbourhoods, is a natural and strong prior in 3D shape matching. Geometrically consistent matchings are crucial for many downstream applications, such as texture transfer or statistical…
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…
We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…
The problem of realizing a given degree sequence by a multigraph can be thought of as a relaxation of the classical degree realization problem (where the realizing graph is simple). This paper concerns the case where the realizing…