English
Related papers

Related papers: On the lengths of zigzags in thin complexes

200 papers

Using known results about their integral cohomology ring, we prove that the topological complexity of the space of n-gons in R^3 with prescribed side lengths equals 2n-5, assuming that the space is nonempty and does not contain any…

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

This monograph presents a detailed analysis of hypercomplex numbers in 2, 3 and 4 dimensions, then presents the properties of hypercomplex numbers in 5 and 6 dimensions. It continues with a detailed analysis of hypercomplex numbers in n…

Complex Variables · Mathematics 2007-05-23 Silviu Olariu

At the first, we revise the Kosinski definition of the sum of ordered fuzzy numbers. The associativity of revised sum is investigated here. In addition, we show that the multiple revised sum of finite sequence of trapezoidal ordered fuzzy…

Discrete Mathematics · Computer Science 2017-10-11 Anna Łyczkowska-Hanćkowiak , Krzysztof Piasecki

In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…

Number Theory · Mathematics 2023-05-25 Ben Kane , Zichen Yang

We prove that in any $\mathbb{Z}^n$-periodic triangulation of $\mathbb{R}^n$ the number of $\mathbb{Z}^n$-orbits of $n$-dimensional simplices is at least the tensor rank of the $n$th determinant tensor. The latter is known to be at least…

Combinatorics · Mathematics 2025-09-29 Sergey Avvakumov , Roman Karasev

We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…

Computational Complexity · Computer Science 2018-12-03 Bruno Durand , Leonid A. Levin , Alexander Shen

Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…

Metric Geometry · Mathematics 2010-06-29 L. Hakova , M. Larouche , J. Patera

Elementary complex analysis and Hilbert space methods show that a union of at most n arcs on the circle is uniquely determined by the nth Fourier partial sum of its characteristic function. The endpoints of the arcs can be recovered from…

Functional Analysis · Mathematics 2010-10-22 Dennis Courtney

Recently, Jha (arXiv:2007.04243, arXiv:2011.11038) has found identities that connect certain sums over the divisors of $n$ to the number of representations of $n$ as a sum of squares and triangular numbers. In this note, we state a…

Number Theory · Mathematics 2024-09-04 Subhajit Bandyopadhyay , Nayandeep Deka Baruah

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

Combinatorics · Mathematics 2007-05-23 H. A. Verrill

A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on…

Geometric Topology · Mathematics 2007-05-23 M. Deza , M. Dutour

In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this expanded generating set. In this article we give a simple…

Combinatorics · Mathematics 2020-03-02 Joel Brewster Lewis , Jon McCammond , T. Kyle Petersen , Petra Schwer

We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…

Geometric Topology · Mathematics 2019-01-30 Gennaro Amendola

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

Computational Geometry · Computer Science 2013-07-30 David Eppstein , Maarten Löffler

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

Combinatorics · Mathematics 2009-06-04 Michael Goff

A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…

General Mathematics · Mathematics 2007-05-23 Iosif Pinelis

This note deals with the relationship between the abscissas of simple, uniform and absolute convergence for the Dirichlet series $f(s) = \sum_{n=1}^\infty a_n n^{-s}$, when the coefficients $a_n$ are either multiplicative or completely…

Number Theory · Mathematics 2018-07-24 Ole Fredrik Brevig , Winston Heap

We consider endomorphism algebras of $n$-term silting complexes in derived categories of hereditary algebras, and we show that the module category of such an endomorphism algebra has a separated $n$-section. For $n=3$ we obtain a trisection…

Representation Theory · Mathematics 2024-11-06 Lidia Angeleri Hügel , Marcelo Lanzilotta , Jifen Liu , Sonia Trepode

We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.

Number Theory · Mathematics 2022-12-06 Johann Cigler