English
Related papers

Related papers: Gap sets of random generalized numerical semigroup…

200 papers

Let $G$ be a connected semisimple algebraic group of adjoint type defined over an algebraically closed field $K$ of positive characteristic. The characteristic $p$ is very good for $G$ when $p$ is suitably large and, if $G$ is of type…

Representation Theory · Mathematics 2020-05-12 Richard Mathers

We prove an analog of Aldous' spectral gap conjecture in the generalized symmetric groups $G\wr S_n$ where $G$ is an arbitrary finite group. Moreover, we show that Caputo's extension of the conjecture to hypergraphs transfers to these…

Group Theory · Mathematics 2026-05-22 Niv Levhari , Doron Puder

We study probability inequalities leading to tail estimates in a general semigroup $\mathscr{G}$ with a translation-invariant metric $d_{\mathscr{G}}$. (An important and central example of this in the functional analysis literature is that…

Probability · Mathematics 2020-07-27 Apoorva Khare , Bala Rajaratnam

Fix a sequence of $d$-regular graphs $(G_d)_{d\in \mathbb{N}}$ and denote by $G_{d,p}$ the graph obtained from $G_d$ after edge-percolation with probability $p=c/d$, for a constant $c>0$. We prove a quantitative local convergence of…

Combinatorics · Mathematics 2025-03-17 Sahar Diskin , Mihyun Kang , Lyuben Lichev

We give a definition of thickness in $\mathbb{R}^d$ that is useful even for totally disconnected sets, and prove a Gap Lemma type result. We also guarantee an interval of distances in any direction in thick compact sets, relate thick sets…

Classical Analysis and ODEs · Mathematics 2022-12-14 Alexia Yavicoli

One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…

Combinatorics · Mathematics 2009-03-03 Asaf Shapira , Raphael Yuster

We prove the following instance of a conjecture stated in arXiv:1103.4770. Let $G$ be an abelian semialgebraic group over a real closed field $R$ and let $X$ be a semialgebraic subset of $G$. Then the group generated by $X$ contains a…

Logic · Mathematics 2019-09-26 Elías Baro , Pantelis E. Eleftheriou , Ya'acov Peterzil

A numerical semigroup $S$ is a subset of the non-negative integers containing $0$ that is closed under addition. The Hilbert series of $S$ (a formal power series equal to the sum of terms $t^n$ over all $n \in S$) can be expressed as a…

Commutative Algebra · Mathematics 2019-03-26 Jeske Glenn , Christopher O'Neill , Vadim Ponomarenko , Benjamin Sepanski

The technique known as group averaging provides powerful machinery for the study of constrained systems. However, it is likely to be well defined only in a limited set of cases. Here, we investigate the possibility of using a `renormalized'…

General Relativity and Quantum Cosmology · Physics 2015-06-25 Andres Gomberoff , Donald Marolf

Our main result is to answer a question of Michel Balazard by giving a Dirichlet series with only one zero in its half-plane of convergence. At the end of the paper we also give several sufficient conditions for the Generalized Riemann…

Number Theory · Mathematics 2024-04-29 T. Hilberdink , E. Saias

Let $X\subset {\mathbb P}_{K}^{m}$ be a smooth irreducible projective algebraic variety of dimension $d$, defined over an algebraically closed field $K$ of characteristic $p>0$. We say that $X$ is a generalized Fermat variety of type…

Algebraic Geometry · Mathematics 2024-10-10 Rubén A. Hidalgo , Henry F. Hughes , Maximiliano Leyton-Álvarez

The Cayley sum graph $\Gamma_S$ of a set $S \subseteq \mathbb{Z}_n$ is defined on the vertex set $\mathbb{Z}_n$, with an edge between distinct $x, y \in \mathbb{Z}_n$ if $x + y \in S$. Campos, Dahia, and Marciano have recently shown that if…

Combinatorics · Mathematics 2025-03-05 Rajko Nenadov

Given a semigroup $S$ and $s,t \in S$, write $s \sim_p^1 t$ if $s=pr$ and $t=rp$, for some $p,r \in S \cup \{1\}$. This relation, known as "primary conjugacy", along with its transitive closure $\sim_p$, has been extensively used and…

Group Theory · Mathematics 2025-07-30 Zachary Mesyan

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…

Combinatorics · Mathematics 2018-09-27 Calvin Leng , Christopher O'Neill

The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems. In the average case setting, SoS lower bounds provide strong…

Computational Complexity · Computer Science 2021-11-18 Chris Jones , Aaron Potechin , Goutham Rajendran , Madhur Tulsiani , Jeff Xu

E. Breuillard showed that finite subsets $F$ of matrices in $GL_d(\overline{\mathbb{Q}})$ generating non-virtually solvable groups have normalized height $\widehat{h}(F) \ge \epsilon_d$, for some positive $\epsilon_d >0$. The normalized…

Group Theory · Mathematics 2021-11-01 Lvzhou Chen , Sebastian Hurtado , Homin Lee

We discuss gap labelling for operators generated by the full shift over a compact subset of the real line. The set of Johnson--Schwartzman gap labels is the algebra generated by weights of clopen subsets of the support of the single-site…

Spectral Theory · Mathematics 2024-12-19 David Damanik , Íris Emilsdóttir , Jake Fillman

The Cayley sum graph $\Gamma_A$ of a set $A \subseteq \mathbb{Z}_n$ is defined to have vertex set $\mathbb{Z}_n$ and an edge between two distinct vertices $x, y \in \mathbb{Z}_n$ if $x + y \in A$. Green and Morris proved that if the set $A$…

Combinatorics · Mathematics 2024-12-05 Marcelo Campos , Gabriel Dahia , João Pedro Marciano

Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…

Given a graph $G$ and probability $p$, we form the random subgraph $G_p$ by retaining each edge of $G$ independently with probability $p$. Given $d\in\mathbb{N}$ and constants $0<c<1, \varepsilon>0$, we show that if every subset $S\subseteq…

Combinatorics · Mathematics 2024-07-17 Maurício Collares , Sahar Diskin , Joshua Erde , Michael Krivelevich
‹ Prev 1 8 9 10 Next ›