English
Related papers

Related papers: Combinatorial statistics on restricted growth func…

200 papers

Let $\mathcal{A}=\left(a_i\right)_{i=1}^\infty$ be a weakly increasing sequence of positive integers and let $k$ be a fixed positive integer. For an arbitrary integer $n$, the restricted partition $p_\mathcal{A}(n,k)$ enumerates all the…

Combinatorics · Mathematics 2023-05-02 Krystian Gajdzica

We provide sufficient density condition for a set of nonuniform samples to give rise to a set of sampling for multivariate bandlimited functions when the measurements consist of pointwise evaluations of a function and its first $k$…

Numerical Analysis · Mathematics 2016-09-12 Ben Adcock , Milana Gataric , Anders C. Hansen

In this paper we study quantitative recurrence and the shrinking target problem for dynamical systems coming from overlapping iterated function systems. Such iterated function systems have the important property that a point often has…

Dynamical Systems · Mathematics 2024-01-30 Simon Baker , Henna Koivusalo

We study additive models built with trend filtering, i.e., additive models whose components are each regularized by the (discrete) total variation of their $k$th (discrete) derivative, for a chosen integer $k \geq 0$. This results in $k$th…

Machine Learning · Statistics 2018-11-26 Veeranjaneyulu Sadhanala , Ryan J. Tibshirani

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

Combinatorics · Mathematics 2012-07-16 Noga Alon

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

Combinatorics · Mathematics 2012-08-29 Guillem Perarnau

In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…

Mathematical Physics · Physics 2009-11-11 C. S. Srivatsan , M. V. N. Murthy , R. K. Bhaduri

A partition $\alpha$ is said to contain another partition (or pattern) $\mu$ if the Ferrers board for $\mu$ is attainable from $\alpha$ under removal of rows and columns. We say $\alpha$ avoids $\mu$ if it does not contain $\mu$. In this…

Combinatorics · Mathematics 2020-01-27 Jonathan Bloom , Nathan McNew

We describe the shrinking target problem for random iterated function systems which semi-conjugate to a random subshifts of finite type. We get the Hausdorff dimension of the set based on shrinking target problems with given targets. The…

Dynamical Systems · Mathematics 2017-07-06 Zhihui Yuan

The combined work of Bousquet-M\'elou, Claesson, Dukes, Jel\'inek, Kitaev, Kubitzke and Parviainen has resulted in non-trivial bijections among ascent sequences, (2+2)-free posets, upper-triangular integer matrices, and pattern-avoiding…

Combinatorics · Mathematics 2019-05-27 Mark Dukes , Peter R. W. McNamara

We study randomized algorithms for constrained optimization, in abstract frameworks that include, in strictly increasing generality: convex programming; LP-type problems; violator spaces; and a setting we introduce, consistent spaces. Such…

Computational Geometry · Computer Science 2019-06-04 Kenneth L. Clarkson , Bernd Gärtner , Johannes Lengler , May Szedlak

We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is…

Probability · Mathematics 2008-03-13 Remco van der Hofstad , Wouter Kager

We study (asymmetric) $U$-statistics based on a stationary sequence of $m$-dependent variables; moreover, we consider constrained $U$-statistics, where the defining multiple sum only includes terms satisfying some restrictions on the gaps…

Probability · Mathematics 2022-03-10 Svante Janson

We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…

Statistical Mechanics · Physics 2015-10-28 Pragya Shukla , Suchetana Sadhukhan

We find that a wide variety of families of partition statistics stabilize in a fashion similar to $p_k(n)$, the number of partitions of n with k parts, which satisfies $p_k(n) = p_{k+1}(n + 1), k \geq n/2$. We bound the regions of…

Combinatorics · Mathematics 2013-07-05 Robert P. Boyer , William J. Keith

Let $S_n$ and $S_{n,k}$ be, respectively, the number of subsets and $k$-subsets of $\mathbb{N}_n=\{1,\ldots,n\}$ such that no two subset elements differ by an element of the set $\mathcal{Q}$, the largest element of which is $q$. We prove a…

Combinatorics · Mathematics 2025-07-22 Michael A. Allen

In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some…

Combinatorics · Mathematics 2018-12-10 Somaya Barati , Beáta Bényi , Abbas Jafarzadeh , Daniel Yaqubi

We investigate the modeling and the numerical solution of machine learning problems with prediction functions which are linear combinations of elements of a possibly infinite-dimensional dictionary. We propose a novel flexible composite…

Statistics Theory · Mathematics 2015-12-03 Patrick L. Combettes , Saverio Salzo , Silvia Villa

We study positional statistics for four families of pattern-avoiding permutations counted by the large Schr\"oder numbers. Specifically, we focus on the pairs of patterns {2413,3142} (separable permutations), {1324,1423}, {1423,2413}, and…

Combinatorics · Mathematics 2026-03-27 Juan B. Gil , Oscar A. Lopez , Michael D. Weiner

The restricted partition function $p_{N}(n)$ counts the partitions of $n$ into at most $N$ parts. In the nineteenth century Sylvester showed that these partitions can be expressed as a sum of $k$-periodic quasi-polynomials ($1\leq k\leq N$)…

Number Theory · Mathematics 2023-02-22 N. Uday Kiran