English
Related papers

Related papers: Asymptotic Enumeration and Limit Laws for Multiset…

200 papers

In this paper we study satisfiability of random equations in an infinite finitely generated nilpotent group G. We show that the set SAT(G,k) of all equations in k > 1 variables over G which are satisfiable in G has an intermediate…

Group Theory · Mathematics 2011-06-10 Robert Gilman , Alexei Myasnikov , Vitalii Romankov

Even though the first momenta i.e. the ensemble average quantities in canonical ensemble (CE) give the grand canonical (GC) results in large multiplicity limit, the fluctuations involving second moments do not respect this asymptotic…

Nuclear Theory · Physics 2015-06-26 A. Keranen , F. Becattini , V. V. Begun , M. I. Gorenstein , O. S. Zozulya

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Information Theory · Computer Science 2022-03-30 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan

We prove a new asymptotic un-equipartition property for the perplexity of long texts generated by a language model and present supporting experimental evidence from open-source models. Specifically we show that the logarithmic perplexity of…

Computation and Language · Computer Science 2025-09-15 Tyler Bell , Avinash Mudireddy , Ivan Johnson-Eversoll , Soura Dasgupta , Raghu Mudumbai

We establish the asymptotic behaviour of $\mu(G(n,p))$, the number of unlabelled induced subgraphs in the binomial random graph $G(n,p)$, for almost the entire range of the probability parameter $p=p(n)\in[0,1]$. In particular, we show that…

Combinatorics · Mathematics 2025-05-21 Michael Krivelevich , Maksim Zhukovskii

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

Number Theory · Mathematics 2007-05-23 Greg Martin , Kevin O'Bryant

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…

Computational Complexity · Computer Science 2024-12-20 Mario Ullrich , Jan Vybíral

Let G be a finitely generated group with a given word metric. The asymptotic density of elements in G that have a particular property P is defined to be the limit, as r goes to infinity, of the proportion of elements in the ball of radius r…

Group Theory · Mathematics 2007-05-23 Pallavi Dani

For a family $(A_q)_{q\in Q}$ of subsets of a semigroup, the product intersection set records those exponents $h \in \mathbb{N}$ for which the $h$-fold product set of the intersection, $(\bigcap_q A_q)^h$, is equal to $\bigcap_q A_q^h$, the…

Combinatorics · Mathematics 2026-04-28 Wouter van Doorn , Pietro Monticone , Quanyu Tang

Given positive integers n and m, and a probability measure P on {0, 1, ..., m} the random intersection graph G(n,m,P) on vertex set V = {1,2, ..., n} and with attribute set W = {w_1, w_2, ..., w_m} is defined as follows. Let S_1, S_2, ...,…

Combinatorics · Mathematics 2017-12-15 Mindaugas Bloznelis , Valentas Kurauskas

We consider classes $\mathscr{G}^s ([0,1])$ of subsets of $[0,1]$, originally introduced by Falconer, that are closed under countable intersections, and such that every set in the class has Hausdorff dimension at least $s$. We provide a…

Number Theory · Mathematics 2017-09-12 Tomas Persson , Henry W. J. Reeve

In previous papers, we studied the asymptotic behaviour of $S_N(A,X)=(2N+1)^{-d/2}\sum_{n \in A_N} X_n,$ where $X$ is a centered, stationary and weakly dependent random field, and $A_N=A \cap [-N,N]^d$, $A \subset \mathbb{Z}^d$. This leads…

Methodology · Statistics 2009-11-06 Beatriz Marron , Ana Tablar

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

Combinatorics · Mathematics 2019-04-19 Andrew MacFie

Machine learning continues to grow in popularity due to its ability to learn increasingly complex tasks. However, for many supervised models, the shift in a data distribution or the appearance of a new event can result in a severe decrease…

Machine Learning · Computer Science 2021-10-19 Ryan King , Bobak Mortazavi

We investigate the occurrence of additive and multiplicative structures in random subsets of the natural numbers. Specifically, for a Bernoulli random subset of $\mathbb{N}$ where each integer is included independently with probability…

Combinatorics · Mathematics 2025-11-03 Sukrit Chakraborty , Sayan Goswami , Sourav Kanti Patra

A convenient framework for dealing with asymptotic limit problems of probabilistic nature is provided. These problems include questions such as finding the asymptotic proportion of terms of a sequence falling inside a given interval, or the…

History and Overview · Mathematics 2024-04-08 Michaël Bensimhoun

A subset $A$ of a group $G$ is called product-free if there is no solution to $a=bc$ with $a,b,c$ all in $A$. It is easy to see that the largest product-free subset of the symmetric group $S_n$ is obtained by taking the set of all odd…

Combinatorics · Mathematics 2022-05-31 Peter Keevash , Noam Lifshitz , Dor Minzer

Asymptotic normality is frequently observed in large combinatorial structures, rigorously established for many quantities such as cycles or inversions in random permutations, the number of prime factors of random integers, and various…

Algebraic Geometry · Mathematics 2026-05-05 Jinwon Choi , Young-Hoon Kiem

We study families of subsets of $\omega$ which are independent with respect to the asymptotic density $\mathsf{d}$. We show, for instance, that there exists a maximal $\mathsf{d}$-independent family $\mathcal{A}$ such that…

Logic · Mathematics 2026-04-01 Jonathan M. Keith , Paolo Leonetti

This paper studies semi-supervised object classification in relational data, which is a fundamental problem in relational data modeling. The problem has been extensively studied in the literature of both statistical relational learning…

Machine Learning · Computer Science 2020-07-27 Meng Qu , Yoshua Bengio , Jian Tang