English
Related papers

Related papers: Restricted growth function patterns and statistics

200 papers

Random cut forest (RCF) algorithms have been developed for anomaly detection, particularly in time series data. The RCF algorithm is an improved version of the isolation forest (IF) algorithm. Unlike the IF algorithm, the RCF algorithm can…

Machine Learning · Computer Science 2024-01-10 Sijin Yeom , Jae-Hun Jung

In this paper we analyze the joint rate distortion function (RDF), for a tuple of correlated sources taking values in abstract alphabet spaces (i.e., continuous) subject to two individual distortion criteria. First, we derive structural…

Information Theory · Computer Science 2021-05-11 Evagoras Stylianou , Charalambos D. Charalambous , Themistoklis Charalambous

Recently Richard Stanley initiated a study of the distribution of the length as(w) of the longest alternating subsequence in a random permutation w from the symmetric group $S_n$. Among other things he found an explicit formula for the…

Combinatorics · Mathematics 2007-05-23 Harold Widom

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

Combinatorics · Mathematics 2026-02-25 Mahdi Koutchoukali

Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…

Probability · Mathematics 2019-09-25 Ioana Dumitriu , Tobias Johnson , Soumik Pal , Elliot Paquette

We consider here the strong regularity for $3$-uniform hypergraphs developed by Frankl, Gowers, Kohayakawa, Nagle, R\"{o}dl, Skokan, and Schacht. This type of regular decomposition comes with two components, a partition of the vertices, and…

Combinatorics · Mathematics 2025-08-05 C. Terry

For a vector $\mathbf a=(a_1,\ldots,a_r)$ of positive integers we prove formulas for the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0,…

Combinatorics · Mathematics 2018-12-11 Mircea Cimpoeas , Florin Nicolae

A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…

Probability · Mathematics 2020-03-24 Nicolas Broutin , Luc Devroye , Nicolas Fraiman

Given positive integers $n$ and $k$, a $k$-term semi-progression of scope $m$ is a sequence $(x_1,x_2,...,x_k)$ such that $x_{j+1} - x_j \in \{d,2d,\ldots,md\}, 1 \le j \le k-1$, for some positive integer $d$. Thus an arithmetic progression…

Combinatorics · Mathematics 2014-01-14 Mano Vikash Janardhanan , Sujith Vijay

A preferential arrangement of a set $X_n=\{1,2,...,n\}$ is an ordered partition of the set $X_n$ induced with a linear order. Separation of blocks of a preferential arrangement with bars result in the notation of barred preferential…

Combinatorics · Mathematics 2017-01-05 S. Nkonkobe , V. Murali

Let $G$ be a finite abelian group with $\exp(G)$ the exponent of $G$. Then $\mathsf W(G)$ denotes the set of cross numbers of minimal zero-sum sequences over $G$ and $\mathsf w(G)$ denotes the set of all cross numbers of non-trivial…

Combinatorics · Mathematics 2024-03-13 Aqsa Bashir , Wolfgang A. Schmid

An integer partition of $n$ is called graphical if its parts form a degree sequence of a simple graph. While unrestricted graphical partitions have been extensively studied, much less is known when the parts are restricted to a prescribed…

Number Theory · Mathematics 2026-04-02 Gilead Levy

Let $N(n,r,k)$ denote the number of binary words of length $n$ that begin with $0$ and contain exactly $k$ runs (i.e., maximal subwords of identical consecutive symbols) of length $r$. We show that the generating function for the sequence…

Combinatorics · Mathematics 2017-07-17 James J. Madden

Consider a random graph process with $n$ vertices corresponding to points $v_{i} \sim {Unif}[0,1]$ embedded randomly in the interval, and where edges are inserted between $v_{i}, v_{j}$ independently with probability given by the graphon…

Probability · Mathematics 2024-06-26 Jeannette Janssen , Aaron Smith

Let $(M,g)$ be a smooth, compact, Riemannian manifold and $\{\phi_h\}$ a sequence of $L^2$-normalized Laplace eigenfunctions on $M$. For a smooth submanifold $H\subset M$, we consider the growth of the restricted eigenfunctions $\phi_h|_H$…

Analysis of PDEs · Mathematics 2022-04-06 Madelyne M. Brown

We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…

Combinatorics · Mathematics 2007-05-23 Mahendra Jani , Robert G. Rieper

Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over $x$ and the Catalan generating function $C(x) =…

Combinatorics · Mathematics 2022-02-28 Christian Bean , Antonio Bernini , Matteo Cervetti , Luca Ferrari

Algorithm and code to produce sequences whose members obey Gaussian distribution function is reported. Discreet and limited number of groups are defined in the distribution function, where each group is represented only with one value…

Data Analysis, Statistics and Probability · Physics 2011-12-19 Sparisoma Viridi , Veinardi Suendo

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

Combinatorics · Mathematics 2016-07-21 David Callan , Shi-Mei Ma , Toufik Mansour

Let $X=(X_i)_{i\ge 1}$ and $Y=(Y_i)_{i\ge 1}$ be two sequences of independent and identically distributed (iid) random variables taking their values, uniformly, in a common totally ordered finite alphabet. Let LCI$_n$ be the length of the…

Probability · Mathematics 2018-08-27 Jean-Christophe Breton , Christian Houdré