English
Related papers

Related papers: The threshold for integer homology in random d-com…

200 papers

We consider a multi-parameter model for randomly constructing simplicial complexes. This model interpolates between random clique complexes and Linial-Meshulam random $k$-dimensional complexes, two models that have been extensively studied.…

Algebraic Topology · Mathematics 2015-06-04 Christopher F. Fowler

An $n$-vertex $k$-uniform hypergraph $G$ is $(d,\alpha)$-degenerate if $m_1(G)\le{d}$ and there exists a constant $\varepsilon >0$ such that for every subset $U\subseteq{V(G)}$ with size $2\le|U|\le{\varepsilon n}$, we have…

Combinatorics · Mathematics 2024-12-06 Yu Chen , Jie Han , Haoran Luo

In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…

Algebraic Topology · Mathematics 2015-03-03 A. Costa , M. Farber

We give a lower and an upper bound for the conformal dimension of the boundaries of certain small cancellation groups. We apply these bounds to the few relator and density models for random groups. This gives generic bounds of the following…

Geometric Topology · Mathematics 2012-04-13 John M. Mackay

Resolving a conjecture of K\"uhn and Osthus from 2012, we show that $p= 1/\sqrt{n}$ is the threshold for the random graph $G_{n,p}$ to contain the square of a Hamilton cycle.

Combinatorics · Mathematics 2020-10-20 Jeff Kahn , Bhargav Narayanan , Jinyoung Park

Let R be a complete intersection ring and let M and N be R-modules. It is shown that the vanishing of Ext^i_R(M,N) for a certain number of consecutive values of i starting at n forces the complete intersection dimension of M to be at most…

Commutative Algebra · Mathematics 2013-04-02 Arash Sadeghi

We show that the hereditary discrepancy of homogeneous arithmetic progressions is lower bounded by $n^{1/O(\log \log n)}$. This bound is tight up to the constant in the exponent. Our lower bound goes via proving an exponential lower bound…

Combinatorics · Mathematics 2015-04-10 Aleksandar Nikolov , Kunal Talwar

We will provide bounds on both the Betti numbers and the torsion part of the homology of hyperbolic orbifolds. These bounds are linear in the volume and are a direct consequence of an efficient simplicial model of the thick part, which we…

Geometric Topology · Mathematics 2021-01-01 Hartwig Senska

In recent years, the mathematical limits and algorithmic bounds for probabilistic group testing have become increasingly well-understood, with exact asymptotic thresholds now being known in general scaling regimes for the noiseless setting.…

Information Theory · Computer Science 2024-10-24 Junren Chen , Jonathan Scarlett

This paper investigates the dependence between primes in tuples through the analysis of the Hardy-Littlewood constant. A detailed analysis of the behavior of the constant for the pattern $(0,d)$ is conducted, depending on the arithmetic…

General Mathematics · Mathematics 2026-01-15 Victor Volfson

We prove several relations on the $f$-vectors and Betti numbers of flag complexes. For every flag complex $\Delta$, we show that there exists a balanced complex with the same $f$-vector as $\Delta$, and whose top-dimensional Betti number is…

Combinatorics · Mathematics 2019-08-23 Kai Fong Ernest Chong , Eran Nevo

We use an information-theoretic argument due to O'Connell (2000) to prove that every sufficiently symmetric event concerning a countably infinite family of independent and identically distributed random variables is deterministic (i.e., has…

Probability · Mathematics 2025-03-26 Yahya Ayach , Anthony Khairallah , Tia Manoukian , Jad Mchaimech , Adam Salha , Siamak Taati

In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…

Computational Geometry · Computer Science 2015-03-23 Sariel Har-Peled , Benjamin Raichel

Let $p$ be a prime number, let $d$ be an integer and let $G$ be a $d$-generated finite $p$-group of nilpotency class smaller than $p$. Then the number of possible isomorphism types for the mod $p$ cohomology algebra $H^*(G;{\mathbb F}_p)$…

Group Theory · Mathematics 2016-12-21 Antonio Díaz Ramos , Oihana Garaialde Ocaña , Jon González-Sánchez

We show that, apart from some obvious exceptions, the number of trinomials vanishing at given complex numbers is bounded by an absolute constant. When the numbers are algebraic, we also bound effectively the degrees and the heights of these…

Number Theory · Mathematics 2019-08-29 Yuri Bilu , Florian Luca

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

Number Theory · Mathematics 2016-01-28 Liuquan Wang

We provide new vanishing and glueing results for relative simplicial volume, following up on two current themes in bounded cohomology: The passage from amenable groups to boundedly acyclic groups and the use of equivariant topology. More…

Algebraic Topology · Mathematics 2022-02-14 Kevin Li , Clara Loeh , Marco Moraschini

We obtain explicit expressions for the annealed complexities associated respectively with the total number of (i) stationary points and (ii) local minima of the energy landscape for an elastic manifold with internal dimension $d<4$ embedded…

Disordered Systems and Neural Networks · Physics 2020-03-11 Yan V Fyodorov , Pierre Le Doussal

Consider the problem of determining the maximal induced subgraph in a random $d$-regular graph such that its components remain bounded as the size of the graph becomes arbitrarily large. We show, for asymptotically large $d$, that any such…

Probability · Mathematics 2019-11-05 Mustazee Rahman

We study Hamiltonicity in the union of an $n$-vertex graph $H$ with high minimum degree and a binomial random graph on the same vertex set. In particular, we consider the case when $H$ has minimum degree close to $n/2$. We determine the…

Combinatorics · Mathematics 2024-10-21 Alberto Espuny Díaz , Richarlotte Valérà Razafindravola