English
Related papers

Related papers: On the lengths of zigzags in thin complexes

200 papers

Zigzags and generalized zigzags in thin chamber complexes are investigated, in particular, all zigzags in the Coxeter complexes are described. Using this description, we show that the lengths of all generalized zigzags in the simplex…

Combinatorics · Mathematics 2017-02-02 Michel Deza , Mark Pankov

We consider closed simplicial and cubical $n$-complexes in terms of link of their $(n-2)$-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2)$-face is contained in 3 or 4 $n$-faces. Such simplicial…

Geometric Topology · Mathematics 2007-05-23 Michel Deza , Mathieu Dutour , Mikhail Shtogrin

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 define a so-called square $k$-zig-zag shape as a part of the regular square grid. Considering the shape as a $k$-zig-zag digraph, we give values of its vertices according to the number of the shortest paths from a base vertex. It…

Combinatorics · Mathematics 2021-05-14 László Németh , László Szalay

An embedded graph is called $z$-knotted if it contains the unique zigzag (up to reversing). We consider $z$-knotted triangulations, i.e. $z$-knotted embedded graphs whose faces are triangles, and describe all cases when the connected sum of…

Combinatorics · Mathematics 2017-08-15 Mark Pankov , Adam Tyc

We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…

Combinatorics · Mathematics 2024-11-21 Kassahun H Betre , Yan X Zhang , Carter Edmond

It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$. In this paper generalize this result in two directions. On…

Combinatorics · Mathematics 2026-04-22 Robert Dougherty-Bliss , Sergi Elizalde

A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…

History and Overview · Mathematics 2007-05-23 Wai Yan Pong

We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming…

Discrete Mathematics · Computer Science 2012-05-01 Anunay Kulshrestha

We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry…

Combinatorics · Mathematics 2010-07-28 Michel Deza , Mathieu Dutour Sikiric

Using known results about their mod-2 cohomology ring, we prove that the topological complexity of the space of isometry classes of n-gons in the plane with one side of length r and all others of length 1 equals either 2n-5 or 2n-6,…

Algebraic Topology · Mathematics 2015-07-07 Donald M. Davis

For $n,\,d\ge1$ let $p(n,2d)$ denote the smallest number $p$ such that every sum of squares of forms of degree $d$ in $\mathbb{R}[x_1,\dots,x_n]$ is a sum of $p$ squares. We establish lower bounds for these numbers that are considerably…

Algebraic Geometry · Mathematics 2016-03-18 Claus Scheiderer

In this note we show the n-2-dimensional volumes of codimension 2 faces of an n-dimensional simplex are algebraically independent functions of the lengths of edges. In order to prove this we compute the complete spectrum of a…

Metric Geometry · Mathematics 2008-03-11 Igor Rivin

We determine which simplicial complexes have the maximum or minimum sum of Betti numbers and sum of bigraded Betti numbers with a given number of vertices in each dimension.

Combinatorics · Mathematics 2024-07-30 Pimeng Dai , Li Yu

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

Combinatorics · Mathematics 2007-05-23 Igor Rivin

We determine the symmetrized topological complexity of the circle, using primarily just general topology.

Algebraic Topology · Mathematics 2017-03-17 Donald M Davis

Zigzags in graphs embedded in surfaces are cyclic sequences of edges whose any two consecutive edges are different, have a common vertex and belong to the same face. We investigate zigzags in randomly constructed combinatorial tetrahedral…

Combinatorics · Mathematics 2022-06-22 Adam Tyc

In this note, we explore various cohomological invariants on double complexes with the aim of finding their decomposition into irreducible parts, which are of square and zigzag shape. By studying the growth rate of the number of invariants…

Differential Geometry · Mathematics 2026-03-24 Victor Chen

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,…

Combinatorics · Mathematics 2026-05-13 Sergey Fomin , Nathan Reading

We consider the sum of squares function in the ring $\mathbb{Z}_{n}$. We determine formulae in a number of cases when $n$ is a power of a prime.

Number Theory · Mathematics 2022-01-19 Rob Burns
‹ Prev 1 2 3 10 Next ›