English
Related papers

Related papers: A Class of Exponential Sequences with Shift-Invari…

200 papers

We consider subsets of the (symbolic) sequence space that are invariant under the action of the semigroup of multiplicative integers. A representative example is the collection of all 0-1 sequences $(x_k)$ such that $x_k x_{2k}=0$ for all…

Dynamical Systems · Mathematics 2018-02-08 Richard Kenyon , Yuval Peres , Boris Solomyak

For a finite subset $I$ of positive integers, the descent polynomial $\mathcal{D}(I;n)$ counts the number of permutations in $S_n$ that have descent set $I$. We generalize descent polynomials by considering permutations with a specific…

Combinatorics · Mathematics 2025-11-11 Jeongwon Lee , Nathan Lesnevich , Martha Precup

In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to…

Number Theory · Mathematics 2024-05-31 Robert Schneider , James A. Sellers , Ian Wagner

We consider two infinite classes of ordinary difference equations admitting Lax pair representation. Discrete equations in these classes are parameterized by two integers $k\geq 0$ and $s\geq k+1$. We describe the first integrals for these…

Exactly Solvable and Integrable Systems · Physics 2016-02-17 Andrei K. Svinin

In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descent polynomial, and suggested the…

Combinatorics · Mathematics 2020-12-01 Kaarel Hänni

Let $n$ be a nonnegative integer and $I$ be a finite set of positive integers. In 1915, MacMahon proved that the number of permutations in the symmetric group $\mathfrak{S}_n$ with descent set $I$ is a polynomial in $n$. We call this the…

Combinatorics · Mathematics 2017-11-15 Alexander Diaz-Lopez , Pamela E. Harris , Erik Insko , Mohamed Omar , Bruce E. Sagan

The known families of difference sets can be subdivided into three classes: difference sets with Singer parameters, cyclotomic difference sets, and difference sets with gcd$(v,n)>1$. It is remarkable that all the known difference sets with…

Combinatorics · Mathematics 2015-06-30 Tao Feng , Sihuang Hu , Shuxing Li , Gennian Ge

For certain sequences $A$ of positive integers with missing $g$-adic digits, the Dirichlet series $F_A(s) = \sum_{a\in A} a^{-s}$ has abscissa of convergence $\sigma_c < 1$. The number $\sigma_c$ is computed. This generalizes and…

Number Theory · Mathematics 2021-11-05 Melvyn B. Nathanson

A new method for multinomial inference is proposed by representing the cell probabilities as unordered segments on the unit interval and following Dempster-Shafer (DS) theory. The resulting DS posterior is then strengthened to improve…

Methodology · Statistics 2024-10-10 Earl C. Lawrence , Alexander C. Murph , Scott A. Vander Wiel , Chaunhai Liu

In the present paper we continue the project of systematic construction of invariant differential operators on the example of the non-compact algebras $sp(n,1)$. Our choice of these algebras is motivated by the fact that they belong to a…

Representation Theory · Mathematics 2024-05-07 N. Aizawa , V. K. Dobrev

For a positive integer \( k \), let \( [k] = \{1, 2, \ldots, k\} \). Let \( h \) be a non-negative integer, and let \( n \) be a multiple of \( h + 1 \). Define \( H \) as the disjoint union of \( n/(h+1) \) cliques (each of size \( h + 1…

Combinatorics · Mathematics 2026-04-15 Zhen Liu , Qinghou Zeng

The sequence $A067549$ of The On-Line Encyclopedia of Integer Sequences is defined as $(a_k)_{k \geq 1}$ with $a_k$ being the determinant of the $k \times k$ matrix whose diagonal contains the first $k$ prime numbers and all other elements…

Number Theory · Mathematics 2025-12-19 Florian Pausinger

One of the longest-standing open problems in computational geometry is to bound the lower envelope of $n$ univariate functions, each pair of which crosses at most $s$ times, for some fixed $s$. This problem is known to be equivalent to…

Discrete Mathematics · Computer Science 2013-05-21 Seth Pettie

Motivated by real-world machine learning applications, we consider a statistical classification task in a sequential setting where test samples arrive sequentially. In addition, the generating distributions are unknown and only a set of…

Machine Learning · Statistics 2021-02-11 Mahdi Haghifam , Vincent Y. F. Tan , Ashish Khisti

We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…

Statistical Mechanics · Physics 2010-12-17 E. Ben-Naim

Let G be a finite additive abelian group with exponent exp(G)=n>1 and let A be a nonempty subset of {1,...,n-1}. In this paper, we investigate the smallest positive integer $m$, denoted by s_A(G), such that any sequence {c_i}_{i=1}^m with…

Combinatorics · Mathematics 2011-12-02 Sukumar Das Adhikari , David J. Grynkiewicz , Zhi-Wei Sun

Sequence of positive integers $\{x_n\}_{n\geq1}$ is called similar to $\mathbb {N}$ respectively a given property $A$ if for every $n\geq1$ the numbers $x_n$ and $n$ are in the same class of equivalence respectively $A\enskip(x_n\sim n…

Number Theory · Mathematics 2009-04-20 Vladimir Shevelev

In this paper, we consider a rather general linear evolution equation of fractional type, namely a diffusion type problem in which the diffusion operator is the $s$th power of a positive definite operator having a discrete spectrum in…

Analysis of PDEs · Mathematics 2016-06-09 Jürgen Sprekels , Enrico Valdinoci

The simplest partition function, associated with homogeneous symmetric forms S of degree r in n variables, is integral discriminant J_{n|r}(S) = \int e^{-S(x_1 ... x_n)} dx_1 ... dx_n. Actually, S-dependence remains the same if e^{-S} in…

Mathematical Physics · Physics 2009-12-07 A. Morozov , Sh. Shakirov

Let $G$ be a finite group, written multiplicatively. The Davenport constant of $G$ is the smallest positive integer $D(G)$ such that every sequence of $G$ with $D(G)$ elements has a non-empty subsequence with product $1$. Let $D_{2n}$ be…

Number Theory · Mathematics 2017-02-01 Fabio Enrique Brochero Martínez , Sávio Ribas