English
Related papers

Related papers: Level Eulerian Posets

200 papers

The paper presents some bipartite graph $L_{k,n}$, so called $(k,n)$-level graph, that arise by taking $k$-th and $(n-k)$-th levels of $n$-dimensional Boolean algebra. Two results are establised: (1) precise description of a distance (a…

Combinatorics · Mathematics 2013-11-12 Marcin Łazarz

In a dynamical system $(X,f)$, with $X$ a compact metric space, the chain components, the fundamental building blocks in the Conley decomposition of dynamics, have a natural partial order induced by the chain relation between points.…

Dynamical Systems · Mathematics 2026-03-31 P. Cintioli , A. Della Corte , M. Farotti

The last years have witnessed rapid progress in the topological characterization of out-of-equilibrium systems. We report on robust signatures of a new type of topology -- the Euler class -- in such a dynamical setting. The enigmatic…

Quantum Gases · Physics 2020-07-28 F. Nur Ünal , Adrien Bouhon , Robert-Jan Slager

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

Logic · Mathematics 2019-07-29 M. Malliaris , S. Shelah

This paper considers the degree-diameter problem for extremal and largest known undirected circulant graphs of degree 2 to 9 of arbitrary diameter. As these graphs are vertex transitive it is possible to define their distance partition. The…

Combinatorics · Mathematics 2014-08-06 Robert Lewis

We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and…

Algebraic Topology · Mathematics 2026-04-09 Ulrich Bauer , Thomas Brüstle , Luis Scoccola

A successive vertex ordering of a graph is a linear ordering of its vertices in which every vertex except the first has at least one neighbour appearing earlier. Such orderings arise naturally in incremental growth and…

Combinatorics · Mathematics 2026-04-10 Prarthana Agrawal , Abdurrahman Hadi Erturk , Ard Louis

Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The…

Combinatorics · Mathematics 2013-10-01 Gyula O. H. Katona , Dániel T. Nagy

Given a set S of n points in general position, we consider all k-th order Voronoi diagrams on S, for k=1,...,n, simultaneously. We deduce symmetry relations for the number of faces, number of vertices and number of circles of certain…

Metric Geometry · Mathematics 2007-05-23 Roderik C. Lindenbergh

Given a hypersurface in a complex projective space, we prove that the multidegrees of its toric polar map agree, up to sign, with the coefficients of the Chern-Schwartz-MacPherson class of a distinguished open set, namely the complement of…

Algebraic Geometry · Mathematics 2023-05-03 Thiago Fassarella , Nivaldo Medeiros , Rodrigo Salomão

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Metric Geometry · Mathematics 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

Unlike the case of surfaces of topologically finite type, there are several different Teichm\"uller spaces that are associated to a surface of topological infinite type. These Teichm\"uller spaces first depend (set-theoretically) on whether…

Geometric Topology · Mathematics 2009-07-22 Lixin Liu , Athanase Papadopoulos

Garland introduced a vanishing criterion for a characteristic zero cohomology group of a locally finite and locally connected simplicial complex. The criterion is based on the spectral gaps of the graph Laplacians of the links of faces and…

Combinatorics · Mathematics 2026-05-05 Eric Babson , Volkmar Welker

Recently de Thanhoffer de V\"olcsey and Van den Bergh classified the Euler forms on a free abelian group of rank 4 having the properties of the Euler form of a smooth projective surface. There are two types of solutions: one corresponding…

Algebraic Geometry · Mathematics 2018-12-31 Pieter Belmans , Dennis Presotto

We generate and count isomorphism classes of gluing-parallel posets with interfaces (iposets) on up to eight points, and on up to ten points with interfaces removed. In order to do so, we introduce a new class of iposets with full…

Combinatorics · Mathematics 2022-03-08 Olavi Äikäs , Uli Fahrenberg , Christian Johansen , Krzysztof Ziemiański

Consider an undirected graph whose edges are labeled invertibly in a group. When does every Eulerian trail from one fixed vertex to another have the same label? We give a precise structural answer to this question. Essentially, we show that…

Combinatorics · Mathematics 2026-03-04 Donggyu Kim , Rose McCarty , Caleb McFarland

Ufnarovski remarked in 1990 that it is unknown whether any finitely presented associative algebra of linear growth is automaton, that is, whether the set of normal words in the algebra form a regular language. If the algebra is graded, then…

Rings and Algebras · Mathematics 2017-06-21 Dmitri Piontkovski

Using the E-algebraic systems, various graded irreducible representations of a Leavitt path algebra L of a graph E over a field K are constructed. The concept of a Laurent vertex is introduced and it is shown that the minimal graded left…

Rings and Algebras · Mathematics 2015-07-23 Roozbeh Hazrat , Kulumani M. Rangaswamy

We study Dirichlet series arising as linear functionals on an inner product space of meromorphic functions and establish a relation between the discontinuities of the former on the boundary and the poles and zeros of the latter on the…

Number Theory · Mathematics 2025-10-22 Kevin Smith

A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for distinct objects c,c'. If we keep in place the latter axiom but allow for…

Combinatorics · Mathematics 2016-02-11 Michael E. Hoffman