English
Related papers

Related papers: Leighton's Theorem and Regular Cube Complexes

200 papers

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

Discrete Mathematics · Computer Science 2018-03-26 Didier Caucal

We generalize the notion of an inverse sequence of graph covers from the zero-dimensional dynamical systems to any dynamical system.

Dynamical Systems · Mathematics 2022-03-29 Przemysław Kucharski

We develop the theory of $L^2$-torsion of an automorphism of a group and compute it for every automorphism of a group which is hyperbolic and one-ended relative to a finite collection of virtually polycyclic groups. We also prove a…

Group Theory · Mathematics 2026-03-27 Sam Hughes , Wolfgang Lueck

In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings's methods allow…

Group Theory · Mathematics 2022-09-13 Michael Ben-Zvi , Robert Kropholler , Rylee Alanza Lyman

The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…

Combinatorics · Mathematics 2025-03-24 Yan-Ting Xie , Shou-Jun Xu

A generalized topology in a set $X$ is a collection $\text{Cov}_X$ of families of subsets of $X$ such that the triple $(X,\bigcup \text{Cov}_X,\text{Cov}_X)$ is a generalized topological space in the sense of Delfs and Knebusch. In this…

General Topology · Mathematics 2020-09-09 Artur Piȩkosz , Eliza Wajch

The Cycle double cover (CDC) conjecture states that for every bridgeless graph $G$, there exists a family $\mathcal{F}$ of cycles such that each edge of the graph is contained in exactly two members of $\mathcal{F}$. Given an embedding of a…

Combinatorics · Mathematics 2025-11-11 Babak Ghanbari , Robert Šámal

We prove families of uniform $(L^r,L^s)$ resolvent estimates for simply connected manifolds of constant curvature (negative or positive) that imply the earlier ones for Euclidean space of Kenig, Ruiz and the second author \cite{KRS}. In the…

Analysis of PDEs · Mathematics 2014-06-10 Shanlin Huang , Christopher D. Sogge

Let A be a basic finite dimensional and connected algebra over an algebraically closed field k with zero characteristic. If the ordinary quiver of A has no double bypasses, we show that A admits a Galois covering which satisfies a universal…

Representation Theory · Mathematics 2008-09-29 Patrick Le Meur

The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant…

Discrete Mathematics · Computer Science 2023-12-29 Yuri Faenza , Luca Ferrarini

We introduce the notion of a non--linear Lie conformal superalgebra and prove a PBW theorem for its universal enveloping vertex algebra. We also show that conversely any graded freely generated vertex algebra is the universal enveloping…

Mathematical Physics · Physics 2015-12-18 Alberto De Sole , Victor Kac

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

Logic · Mathematics 2017-12-05 Matthew Harrison-Trainor , Meng-Che Ho

Partial cubes are graphs that can be isometrically embedded into hypercubes. Convex cycles play an important role in the study of partial cubes. In this paper, we prove that a regular partial cube is a hypercube (resp., a Doubled Odd graph,…

Combinatorics · Mathematics 2024-10-15 Yan-Ting Xie , Yong-De Feng , Shou-Jun Xu

Let $U$ be an open relatively compact subanalytic subset of a real analytic manifold. We show that there exists a finite linear covering (in the sense of Guillermou and Schapira) of $U$ by subanalytic open subsets of $U$ homeomorphic to a…

Algebraic Geometry · Mathematics 2014-05-09 Adam Parusinski

First we give a definition of a coverage on a inverse semigroup that is weaker than the one gave by a Lawson and Lenz and that generalizes the definition of a coverage on a semilattice given by Johnstone. Given such a coverage, we prove…

Rings and Algebras · Mathematics 2020-05-19 Gilles G. de Castro

Let $L$ be a finite-dimensional non-abelian Lie algebra with the center $Z(L)$. In this paper, we define a non-commuting graph associated with $L$ as the graph whose vertex set is the projective space of the quotient algebra $L/Z(L)$, and…

Rings and Algebras · Mathematics 2025-05-05 Songpon Sriwongsa

We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…

Geometric Topology · Mathematics 2019-06-26 Mark C. Bell , Valentina Disarlo , Robert Tang

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for…

Group Theory · Mathematics 2020-12-09 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

We formulate and prove a dimension-theoretic generalization of the Lebesgue Covering Theorem. A generalized $n$-dimensional version of the Steinhaus Chessboard Theorem, recently proved by Turza\'nski and Ziajor, is a simple consequence of…

Classical Analysis and ODEs · Mathematics 2026-02-17 Michał Dybowski

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L. The weight of a cycle cover of an edge-weighted graph is…

Computational Complexity · Computer Science 2009-09-29 Bodo Manthey
‹ Prev 1 8 9 10 Next ›