English
Related papers

Related papers: Eulerian 2-Complexes

200 papers

We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…

Combinatorics · Mathematics 2016-07-21 Joseph A. Thas , Koen Thas

In this paper we discuss dilaton shifts (Euler counterterms) arising in decomposition of two-dimensional quantum field theories with higher-form symmetries. These take a universal form, reflecting underlying (noninvertible, quantum)…

High Energy Physics - Theory · Physics 2024-10-02 E. Sharpe

We prove that the Eulerian polynomial satisfies certain polynomial congruences. Furthermore, these congruences characterize the Eulerian polynomial.

Combinatorics · Mathematics 2021-09-03 Kazuki Iijima , Kyouhei Sasaki , Yuuki Takahashi , Masahiko Yoshinaga

In this paper, a proof of the cycle double cover conjecture is presented. The cycle double cover conjecture purports that if a graph is bridgeless, then there exists a list of cycles in the graph such that every edge in the graph appears in…

Combinatorics · Mathematics 2014-04-08 P. Clarke

We characterize the cyclic branched covers of the 2-sphere where every homeomorphism of the sphere lifts to a homeomorphism of the covering surface. This answers a question that appeared in an early version of the erratum of Birman and…

Geometric Topology · Mathematics 2020-03-12 Tyrone Ghaswala , Rebecca R. Winarski

We recall first Gallai-simplicial complex $\Delta_{\Gamma}(G)$ associated to Gallai graph $\Gamma(G)$ of a planar graph $G$. The Euler characteristic is a very useful topological and homotopic invariant to classify surfaces. In Theorems 3.2…

Algebraic Topology · Mathematics 2017-07-05 Imran Ahmed , Shahid Muhmood

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

Combinatorics · Mathematics 2022-10-28 Yanan Hu , Xingzhi Zhan , Leilei Zhang

The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…

Combinatorics · Mathematics 2025-03-19 Nicanor Carrasco-Vargas

We describe and analyze a new construction that produces new Eulerian lattices from old ones. It specializes to a construction that produces new strongly regular cellular spheres (whose face lattices are Eulerian). The construction does not…

Metric Geometry · Mathematics 2007-05-23 Andreas Paffenholz , Günter M. Ziegler

In this paper we study three-dimensional orbifolds by 2-groups with a trivially-acting one-form symmetry group BK. These orbifolds have a global two-form symmetry, and so one expects that they decompose into (are equivalent to) a disjoint…

High Energy Physics - Theory · Physics 2022-09-07 T. Pantev , D. Robbins , E. Sharpe , T. Vandermeulen

A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…

Group Theory · Mathematics 2007-05-23 Brent Everitt

Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…

Metric Geometry · Mathematics 2019-06-26 Oleg R. Musin

We develop a unified theory of Eulerian spaces by combining the combinatorial theory of infinite, locally finite Eulerian graphs as introduced by Diestel and K\"uhn with the topological theory of Eulerian continua defined as irreducible…

General Topology · Mathematics 2021-12-13 Paul Gartside , Max Pitz

We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…

Computational Geometry · Computer Science 2024-01-25 Philip Todd

In this paper we study for the incompressible Euler equations the global structure of the bifurcation diagram for the rotating doubly connected patches near the degenerate case. We show that the branches with the same symmetry merge forming…

Analysis of PDEs · Mathematics 2017-10-11 Taoufik Hmidi , Coralie Renault

For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…

Combinatorics · Mathematics 2007-05-23 Jonas Sjostrand

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…

Group Theory · Mathematics 2018-07-31 Daniel J. Woodhouse

We give simple characterizations of contact 1-forms in terms of Dirac structures. We also relate normal almost contact structures to the theory of Dirac structures.

Differential Geometry · Mathematics 2016-08-16 David Iglesias-Ponte , Aïssa Wade

In this note, we introduce a class of cell decompositions of PL manifolds and polyhedra which are more general than triangulations yet not as general as CW complexes; we propose calling them PLCW complexes. The main result is an analog of…

Geometric Topology · Mathematics 2014-10-01 Alexander Kirillov

We formulate and prove a twofold generalisation of Lie's second theorem that integrates homomorphisms between formal group laws to homomorphisms between Lie groups. Firstly we generalise classical Lie theory by replacing groups with…

Category Theory · Mathematics 2016-05-25 Matthew Burke