Related papers: Regular Incidence Complexes, Polytopes, and C-Grou…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…
An algebraic description of basic discrete symmetries (space reversal P, time reversal T and their combination PT) is studied. Discrete subgroups of orthogonal groups of multidimensional spaces over the fields of real and complex numbers…
A polytrope is a tropical polytope which at the same time is convex in the ordinary sense. A $d$-dimensional polytrope turns out to be a tropical simplex, that is, it is the tropical convex hull of $d+1$ points. This statement is equivalent…
A non-trivial element of a group is a generalized torsion element if some products of its conjugates is the identity. The minimum number of such conjugates is called a generalized torsion order. We provide several restrictions for…
For a complex projective space the inertia group, the homotopy inertia group and the concordance inertia group are isomorphic. In complex dimension 4n+1, these groups are related to computations in stable cohomotopy. Using stable homotopy…
Automorphism groups are intrincate conjugacy invariants for subshifts, which can reveal important features of the dynamical structure of a shift action. One important case is the study of automorphism groups when the underlying subshift has…
We introduce the class of projective reflection groups which includes all complex reflection groups. We show that several aspects involving the combinatorics and the representation theory of all non exceptional irreducible complex…
We introduce so-called cone topologies of paratopological groups, which are a wide way to construct counterexamples, especially of examples of compact-like paratopological groups with discontinuous inversion. We found a simple interplay…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
A triality is a sort of super-symmetry that exchanges the types of the elements of an incidence geometry in cycles of length three. Although geometries with trialities exhibit fascinating behaviors, their construction is challenging, making…
We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or,…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
The edge group of a simplicial complex is a well-known, combinatorial version of the fundamental group. It is a group associated to a simplicial complex that consists of equivalence classes of edge loops and that is isomorphic to the…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
The edges of the characteristic imset polytope, $\operatorname{CIM}_p$, were recently shown to have strong connections to causal discovery as many algorithms could be interpreted as greedy restricted edge-walks, even though only a strict…
Inspired by Coxeter's notion of Petrie polygon for $d$-polytopes (see \cite{Cox73}), we consider a generalization of the notion of zigzag circuits on complexes and compute the zigzag structure for several interesting families of…
Multitriangulations, and more generally subword complexes, yield a large family of simplicial complexes that are homeomorphic to spheres. Until now, all attempts to prove or disprove that they can be realized as convex polytopes faced major…
We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We give examples of finite string $C$-groups (the automorphism groups of abstract regular polytopes) that have irreducible characters of real Schur index $2$. This answers a problem of Monson concerning these groups.