English
Related papers

Related papers: The Fundamental Group of Balanced Simplicial Compl…

200 papers

We resolve a conjecture of Kalai asserting that the $g_2$-number of any simplicial complex $\Delta$ that represents a connected normal pseudomanifold of dimension $d\geq 3$ is at least as large as ${d+2 \choose 2}m(\Delta)$, where…

Combinatorics · Mathematics 2016-06-09 Satoshi Murai , Isabella Novik

We prove that the complex surfaces parametrizing cuboids and face cuboids, as well as their minimal resolution of singularities, have trivial fundamental group. We then compute the fundamental group of certain open smooth subvarieties of…

Algebraic Geometry · Mathematics 2024-09-18 David Jarossay , Francesco Maria Saettone , Yotam Svoray

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

Combinatorics · Mathematics 2021-01-13 Nima Ghanbari , Saeid Alikhani

Motivated by a problem in graph theory, this article introduces an algebra called the balanced algebra. This algebra is defined by generators and relations, and the main goal is to find a minimal set of relations for it.

Combinatorics · Mathematics 2023-05-02 Erika Pirnes

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

Combinatorics · Mathematics 2014-02-26 Saugata Basu

Presenting a finite group by a free product of finite cyclic groups the Hopf formula for the Schur multiplier affords also a covering group, and this has minimal exponent provided that the order of the generators is preserved. This…

Group Theory · Mathematics 2021-12-08 Nicola Sambonet

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Combinatorics · Mathematics 2022-03-01 Tristram Bogart , Juan Andrés Valero

Given a finite poset $\mathcal P$ and two distinct elements $x$ and $y$, we let $\operatorname{pr}_{\mathcal P}(x \prec y)$ denote the fraction of linear extensions of $\mathcal P$ in which $x$ precedes $y$. The balance constant…

Combinatorics · Mathematics 2023-10-03 Evan Chen

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…

Number Theory · Mathematics 2017-06-19 Patrick Ingram

We prove a new upper bound on the essential p-dimension of the projective linear group PGLn.

Rings and Algebras · Mathematics 2017-02-22 Aurel Meyer , Zinovy Reichstein

The notion of noncrossing partitions of a partially ordered set (poset) is introduced here. When the poset in question is $[n]=\{1,2,\dots, n\}$ with the complete order of natural numbers, conventional noncrossing partitions arise. The…

Combinatorics · Mathematics 2024-09-09 Ricky X. F. Chen

A partition of a finite poset into chains places a natural upper bound on the size of a union of k antichains. A chain partition is k-saturated if this bound is achieved. Greene and Kleitman proved that, for each k, every finite poset has a…

Combinatorics · Mathematics 2007-05-23 Glenn G. Chappell

Given a complex of groups over a finite simplicial complex in the sense of Haefliger, we give conditions under which it is possible to build an EZ-structure in the sense of Farrell-Lafont for its fundamental group out of such structures for…

Geometric Topology · Mathematics 2014-11-11 Alexandre Martin

In this note, we extend the notion of minimal gaps to the higher dimensional sequences. We bound the minimal gap for $(\{\boldsymbol{a}_n\boldsymbol{\alpha}\}),$ $(\{a_n\boldsymbol{\alpha}\})$ and…

Number Theory · Mathematics 2024-04-09 Tanmoy Bera

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

Combinatorics · Mathematics 2026-01-05 Robert Coulter , Steven Senger

In this paper, building among others on earlier works by U. Krause and C. Zahlten (dealing with the case of cyclic groups), we obtain a new upper bound for the little cross number valid in the general case of arbitrary finite Abelian…

Number Theory · Mathematics 2011-10-11 Benjamin Girard

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…

Combinatorics · Mathematics 2016-11-08 David Cushing , G. W. Stagg

A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.

Combinatorics · Mathematics 2007-05-23 A. D. Mednykh

We show, using acylindrical hyperbolicity, that a finitely generated group splitting over $\Z$ cannot be simple. We also obtain SQ-universality in most cases, for instance a balanced group (one where if two powers of an infinite order…

Group Theory · Mathematics 2016-03-21 J. O. Button

We prove that every finite simple group of Lie type $G$ can be generated by three regular unipotent elements. In certain cases we show that two regular unipotents are sufficient to generate $G$.

Group Theory · Mathematics 2025-11-18 M. A. Pellegrini , A. E. Zalesski