English
Related papers

Related papers: Danzer's configuration revisited

200 papers

It is possible to construct representations of the Lorentz group using four-dimensional harmonic oscillators. This allows us to construct three-dimensional wave functions with the usual rotational symmetry for space-like coordinates and…

Mathematical Physics · Physics 2007-05-23 Y. S. Kim

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…

Combinatorics · Mathematics 2007-05-23 Michel Deza , Mathieu Dutour

We study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over $\cE = \ZZ[e^{2 \pi i/3}]$: there are only four such lattices,…

Group Theory · Mathematics 2010-12-07 Tathagata Basak

An imprimitive symmetric indecomposable association scheme of rank 5 is said to be Higmanian. A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a symmetric divisible design. We establish conditions which…

Combinatorics · Mathematics 2026-01-27 Grigory Ryabov

We show that for a winding number zero satellite operator $P$ on the knot concordance group, if the axis of $P$ has nontrivial self-pairing under the Blanchfield form of the pattern, then the image of the iteration $P^n$ generates an…

Geometric Topology · Mathematics 2025-03-05 Jae Choon Cha , Taehee Kim

We introduce a graph-theoretic condition, called $(n,m)$--branching, that ensures a combinatorial round tree with controlled branching parameters can be quasi-isometrically embedded in the Davis complex of the right-angled Coxeter group…

Group Theory · Mathematics 2025-10-07 Christopher H. Cashen , Pallavi Dani , Kevin Schreve , Emily Stark

A closed 3-manifold $M$ may be described up to some indeterminacy by a Heegaard diagram $\mathcal{D}$. The question "Does $M$ smoothly embed in $\mathbb{R}^4$?'' is equivalent to a property of $\mathcal{D}$ which we call $\textit{doubly…

Geometric Topology · Mathematics 2024-09-17 Michael H. Freedman

This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…

Category Theory · Mathematics 2024-10-31 Amar Hadzihasanovic

In this article, we give a combinatorial model in terms of symmetric cores of the indexing set of the irreducible components of $\mathcal{H}_n^{\Gamma}$ (the $\Gamma$-fixed points of the Hilbert scheme of $n$ points in $\mathbb{C}^2$)…

Combinatorics · Mathematics 2025-05-29 Raphaël Paegelow

Let $D$ be a digraph. A stable set $S$ of $D$ and a path partition $\mathcal{P}$ of $D$ are orthogonal if every path $P \in \mathcal{P}$ contains exactly one vertex of $S$. In 1982, Berge defined the class of $\alpha$-diperfect digraphs. A…

Combinatorics · Mathematics 2022-07-29 Caroline Aparecida de Paula Silva , Cândida Nunes da Silva , Orlando Lee

The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…

Group Theory · Mathematics 2007-05-23 Yi Ming Zou

Let $D$ be a digraph. Given a set of vertices $S \subseteq V(D)$, an $S$-path partition $\mathcal{P}$ of $D$ is a collection of paths of $D$ such that $\{V(P) \colon P \in \mathcal{P}\}$ is a partition of $V(D)$ and $|V(P) \cap S| = 1$ for…

Combinatorics · Mathematics 2019-04-08 Cândida Nunes da Silva , Orlando Lee , Maycon Sambinelli

We construct spherical harmonics for fuzzy spheres of even and odd dimensions, generalizing the correspondence between finite matrix algebras and fuzzy two-spheres. The finite matrix algebras associated with the various fuzzy spheres have a…

High Energy Physics - Theory · Physics 2014-11-18 Sanjaye Ramgoolam

We prove that the order of the canonical vector bundle over the configuration space is $2$ for a general planar graph, and is $4$ for a nonplanar graph.

Algebraic Topology · Mathematics 2021-10-26 Frederick R. Cohen , Ruizhi Huang

We introduce the notion of a conjugation-free geometric presentation for a fundamental group of a line arrangement's complement, and we show that the fundamental groups of the following family of arrangements have a conjugation-free…

Geometric Topology · Mathematics 2010-03-17 Meital Eliyahu , David Garber , Mina Teicher

It is proved that the numerical semigroups associated to the combinatorial configurations satisfy a family of non-linear symmetric patterns. Also, these numerical semigroups are studied for two particular classes of combinatorial…

Group Theory · Mathematics 2012-12-18 Klara Stokes , Maria Bras-Amorós

An axis-parallel $d$-dimensional box is a cartesian product $I_1\times I_2\times \dots \times I_b$ where $I_i$ is a closed sub-interval of the real line. For a graph $G = (V,E)$, the $boxicity \ of \ G$, denoted by $\text{box}(G)$, is the…

Combinatorics · Mathematics 2021-05-07 Marco Caoduro , Lyuben Lichev

We consider the self-assembly of cross junctions in a general space dimension ($d$) as an extension of the problem studied in a previous paper for $d = 3$. This problem is equivalent to constructing a $d$-dimensional hypercubic jungle gym,…

Statistical Mechanics · Physics 2026-05-26 Kazuya Saito

The braid groups B_n can be defined as the mapping class group of the n-punctured disc. The Lawrence-Krammer representation of the braid group B_n is the induced action on a certain twisted second homology of the space of unordered pairs of…

Group Theory · Mathematics 2007-05-23 Stephen J. Bigelow

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…

Combinatorics · Mathematics 2010-03-10 Michael Huber