English
Related papers

Related papers: Asymptotic Enumeration and Limit Laws for Multiset…

200 papers

Using functional and harmonic analysis methods, we study Kazhdan sets in topological groups which do not necessarily have Property (T). We provide a new criterion for a generating subset $Q$ of a group $G$ to be a Kazhdan set; it relies on…

Group Theory · Mathematics 2018-06-05 Catalin Badea , Sophie Grivaux

This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges…

Probability · Mathematics 2007-06-13 A. D. Barbour , B. Granovsky

For any graph $G=(V,E)$, a subset $S\subseteq V$ is called {\it an isolating set} of $G$ if $V\setminus N_G[S]$ is an independent set of $G$, where $N_G[S]=S\cup N_G(S)$, and {\it the isolation number} of $G$, denoted by $\iota(G)$, is the…

Combinatorics · Mathematics 2025-01-07 Shumin Zhang , Minhui Li , Fengming Dong

A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…

Probability · Mathematics 2026-04-28 Junpei Otsuka

A semitotal dominating set of a graph $G$ with no isolated vertex is a dominating set $D$ of $G$ such that every vertex in $D$ is within distance two of another vertex in $D$. The minimum size $\gamma_{t2}(G)$ of a semitotal dominating set…

Computational Complexity · Computer Science 2018-10-17 Esther Galby , Andrea Munaro , Bernard Ries

For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…

Probability · Mathematics 2014-10-30 Camille Male , Sandrine Péché

In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and…

Combinatorics · Mathematics 2022-05-16 Bela Bollobas , Imre Leader , Marius Tiba

A set $S$ of vertices of a graph $G$ is \emph{distinguishing} if the sets of neighbors in $S$ for every pair of vertices not in $S$ are distinct. A \emph{locating-dominating set} of $G$ is a dominating distinguishing set. The…

Combinatorics · Mathematics 2018-07-19 Carmen Hernando , Mercè Mora , Ignacio M. Pelayo

We isolate a new class of ultrafilters on N, called "quasi-selective" because they are intermediate between selective ultrafilters and P-points. (Under the Continuum Hypothesis these three classes are distinct.) The existence of…

Logic · Mathematics 2017-12-19 Andreas Blass , Mauro Di Nasso , Marco Forti

In this paper we study the asymptotic behavior of the number of summands in tensor products of finite dimensional representations of affine (semi)group (super)schemes and related objects.

Representation Theory · Mathematics 2024-12-11 Kevin Coulembier , Victor Ostrik , Daniel Tubbenhauer

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Number Theory · Mathematics 2019-10-28 David J. Grynkiewicz

We investigate the existence of maximal collections of mutually noncrossing $k$-element subsets of $\left\{ 1, \dots, n \right\}$ that are invariant under adding $k\pmod n$ to all indices. Our main result is that such a collection exists if…

Combinatorics · Mathematics 2019-05-28 Andrea Pasquali , Erik Thörnblad , Jakob Zimmermann

We asymptotically determine the size of the largest family F of subsets of {1,...,n} not containing a given poset P if the Hasse diagram of P is a tree. This is a qualitative generalization of several known results including Sperner's…

Combinatorics · Mathematics 2009-11-21 Boris Bukh

Let $A_1,\ldots,A_n$ be finite subsets of an additive abelian group $G$ with $|A_1|=\cdots=|A_n|\ge2$. Concerning the two new kinds of restricted sumsets $$L(A_1,\ldots,A_n)=\{a_1+\cdots+a_n:\ a_1\in A_1,\ldots,a_n\in A_n,\ \text{and}\…

Number Theory · Mathematics 2022-10-24 Han Wang , Zhi-Wei Sun

We investigate the clustering structure of species sampling sequences $(\xi_n)_n$, with general base measure. Such sequences are exchangeable with a species sampling random probability as directing measure. The clustering properties of…

Probability · Mathematics 2019-08-29 Federico Bassetti , Lucia Ladelli

As a fundamental piece of multi-object Bayesian inference, multi-object density has the ability to describe the uncertainty of the number and values of objects, as well as the statistical correlation between objects, thus perfectly matches…

Systems and Control · Computer Science 2016-03-29 Suqi Li , Wei Yi , Bailu Wang , Lingjiang Kong

A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…

Combinatorics · Mathematics 2024-09-24 Gal Gross

Let $Y$ be a compact metric space, $G$ be a group acting by transformations on $Y$. For any infinite subset $A\subset Y$, we study the density of $gA$ for $g\in G$ and quantitative density of the set $\displaystyle{\bigcup_{g\in G_n}gA}$ by…

Dynamical Systems · Mathematics 2017-09-19 Changguang Dong

Let $(x_{i}, y_{i})_{i=1,\dots,n}$ denote independent samples from a general mixture distribution $\sum_{c\in\mathcal{C}}\rho_{c}P_{c}^{x}$, and consider the hypothesis class of generalized linear models $\hat{y} = F(\Theta^{\top}x)$. In…

Statistics Theory · Mathematics 2024-07-22 Yatin Dandi , Ludovic Stephan , Florent Krzakala , Bruno Loureiro , Lenka Zdeborová

Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are…

Combinatorics · Mathematics 2016-08-25 Dániel T. Nagy