English
Related papers

Related papers: Regular Incidence Complexes, Polytopes, and C-Grou…

200 papers

The article studies power complexes and generalized power complexes, and investigates the algebraic structure of their automorphism groups. The combinatorial incidence structures involved are cube-like, in the sense that they have many…

Combinatorics · Mathematics 2014-12-03 Andrew C. Duke , Egon Schulte

A generalization of incidence relations in abstract polytope has been explored, and parameterized surfaces are used as primers. The abstract orientable incidence structure is defined as an algebraic model of incidence relations, in which…

Combinatorics · Mathematics 2023-03-09 Yu-Wei Huang

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

Metric Geometry · Mathematics 2009-06-08 Daniel Pellicer , Egon Schulte

Regular polygonal complexes in euclidean 3-space are discrete polyhedra-like structures with finite or infinite polygons as faces and with finite graphs as vertex-figures, such that their symmetry groups are transitive on the flags. The…

Combinatorics · Mathematics 2012-10-09 Daniel Pellicer , Egon Schulte

Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…

Combinatorics · Mathematics 2026-04-02 Isabel Hubard , Egon Schulte

In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still…

Combinatorics · Mathematics 2012-01-27 B. Monson , Egon Schulte

We classify C-groups of ranks $n-1$ and $n-2$ for the symmetric group $S_n$. We also show that all these C-groups correspond to hypertopes, that is, thin, residually connected flag-transitive geometries. Therefore we generalise some similar…

Combinatorics · Mathematics 2015-11-02 Maria Elisa Fernandes , Dimitri Leemans

We study incidence geometries that are thin and residually connected. These geometries generalise abstract polytopes. In this generalised setting, guided by the ideas from the polytopes theory, we introduce the concept of chirality, a…

Group Theory · Mathematics 2016-04-13 Maria Elisa Fernandes , Dimitri Leemans , Asia Ivić Weiss

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…

Combinatorics · Mathematics 2007-05-23 Nicolas Ressayre , Pierre-Louis Montagard

A polyhedron in Euclidean 3-space is called a regular polyhedron of index 2 if it is combinatorially regular but "fails geometric regularity by a factor of 2"; its combinatorial automorphism group is flag-transitive but its geometric…

Metric Geometry · Mathematics 2010-05-27 Anthony M. Cutler , Egon Schulte

A polyhedron in Euclidean 3-space is called a regular polyhedron of index 2 if it is combinatorially regular and its geometric symmetry group has index 2 in its combinatorial automorphism group; thus its automorphism group is…

Metric Geometry · Mathematics 2010-11-15 Anthony M. Cutler

Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer , Aaron M. Bruening , Joshua Stewart

A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit label. We define the adjacency, incidence, Kirchoff Laplacian and normalized Laplacian of a complex unit hypergraph and study each of them.…

Combinatorics · Mathematics 2024-05-17 Raffaella Mulas , Nathan Reff

In a d-simplex every facet is a (d-1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer , Tibor Bisztriczky

Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…

Combinatorics · Mathematics 2016-11-25 David Ellison , Ruxandra Marinescu-Ghemeci , Cerasela Tanasescu

Guided by the ideas of chirality in the abstract polytope theory, the present paper aims to extend the concept to a more general setting of incidence geometries. The purpose of this paper is to explore the more general framework of thin…

Group Theory · Mathematics 2016-04-13 Maria Elisa Fernandes , Dimitri Leemans , Asia Ivić Weiss

The intersection pattern of the translates of the limit set of a quasi-convex subgroup of a hyperbolic group can be coded in a natural incidence graph, which suggests connections with the splittings of the ambient group. A similar incidence…

Group Theory · Mathematics 2014-11-11 Mahan Mj , Peter Scott , Gadde Swarup

This paper contains a classication of the regular minimal abstract polytopes that act as covers for the convex polyhedral prisms and antiprisms. It includes a detailed discussion of their topological structure, and completes the enumeration…

Combinatorics · Mathematics 2012-06-28 Michael I. Hartley , Daniel Pellicer , Gordon Williams

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…

Combinatorics · Mathematics 2024-11-04 Peter J. Cameron

Let $I(X,R)$ be the incidence algebra of the preordered set $X$ over the ring $R$. In the case of a finite connected partially ordered set $X$, we prove that the subgroup of inner multiplicative automorphisms is a direct factor of the group…

Rings and Algebras · Mathematics 2024-02-01 Evgenii Kaigorodov , Piotr Krylov , Askar Tuganbaev
‹ Prev 1 2 3 10 Next ›