English
Related papers

Related papers: Upper Bounds for Stern's Diatomic Sequence and Rel…

200 papers

We consider the following polynomial generalization of Stern's diatomic series: let $s_1(x,y)=1$, and for $n\geq 1$ set $s_{2n}(x,y)=s_n(x,y)$ and $s_{2n+1}(x,y)=x\,s_n(x,y)+y\,s_{n+1}(x,y)$. The coefficient $[x^iy^j]s_n(x,y)$ is the number…

Number Theory · Mathematics 2017-11-16 Lukas Spiegelhofer

Bessenrodt and Ono initially found the strict log-subadditivity of partition function $p(n)$, that is, $p(a+b)< p(a)p(b)$ for $a,b>1$ and $a+b>9$. Many other important statistics of partitions are proved to enjoy similar properties. Lovejoy…

Combinatorics · Mathematics 2022-06-28 Helen W. J. Zhang , Ying Zhong

The Sine-Gordon theory at $\frac{\beta^{2}}{8\pi} = \frac{2}{(2n+3)},\; n= 1,2,3 \cdots $ has a higher spin generalization of the $N=2$ supersymmetry with the central terms which arises from the affine quantum group $U_{q}( \hat{s \ell}…

High Energy Physics - Theory · Physics 2016-09-06 H. Itoyama , T. Oota

We consider the behavior of spatial point processes when subjected to a class of linear transformations indexed by a variable T. It was shown in Ellis [Adv. in Appl. Probab. 18 (1986) 646-659] that, under mild assumptions, the transformed…

Probability · Mathematics 2007-05-23 Dominic Schuhmacher

An $(n,k)$-Sperner partition system is a set of partitions of some $n$-set such that each partition has $k$ nonempty parts and no part in any partition is a subset of a part in a different partition. The maximum number of partitions in an…

Combinatorics · Mathematics 2020-10-22 Adam Gowty , Daniel Horsley

The classical Stern sequence of positive integers was extended to a polynomial sequence $S_n(\lambda)$ by Klav\v{z}ar et. al. by defining $S_0(\lambda) = 0$, $S_1(\lambda) = 1$, and $$S_{2n}(\lambda) = \lambda S_n(\lambda),\quad…

Number Theory · Mathematics 2025-11-07 David Altizio

For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…

Combinatorics · Mathematics 2018-04-03 Bart Litjens

We analyze idealized sequential Stern-Gerlach experiments with higher spin particles. This analysis serves at least two purposes: The widely discussed spin-1/2 case leads to some misunderstandings which hopefully is removed by the higher…

Atomic Physics · Physics 2016-03-24 Bayram Tekin

A set S of unit vectors in n-dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b, and inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical…

Metric Geometry · Mathematics 2009-04-02 Oleg R. Musin

A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…

Group Theory · Mathematics 2014-05-05 Alice C. Niemeyer , Cheryl E. Praeger

Arrangements of pseudolines are classic objects in discrete and computational geometry. They have been studied with increasing intensity since their introduction almost 100 years ago. The study of the number $B_n$ of non-isomorphic simple…

Combinatorics · Mathematics 2024-03-22 Fernando Cortés Kühnast , Justin Dallant , Stefan Felsner , Manfred Scheucher

The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$,…

Metric Geometry · Mathematics 2016-12-01 Alexey Glazyrin , Wei-Hsuan Yu

We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…

Probability · Mathematics 2023-01-03 Tiefeng Jiang , Ke Wang

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

Combinatorics · Mathematics 2019-01-21 David E Speyer

Let $\mathcal D_n$ denote the average number of iterations of West's stack-sorting map $s$ that are needed to sort a permutation in $S_n$ into the identity permutation $123\cdots n$. We prove that…

Combinatorics · Mathematics 2020-09-29 Colin Defant

We generalize Stern's diatomic sequence in three ways.

Combinatorics · Mathematics 2015-03-12 Sam Northshield

Given a real number $\alpha \in (0,1)$, we define the Webster sequence of density $\alpha$ to be $W_\alpha = (\lceil(n-1/2) / \alpha\rceil)_{n\in\mathbb{N}}$, where $\lceil x \rceil$ is the ceiling function. It is known that if $\alpha$ and…

Number Theory · Mathematics 2021-10-12 Xiaomin Li

Let $La(n,P)$ be the maximum size of a family of subsets of $[n]=\{1,2,...,n\}$ not containing $P$ as a (weak) subposet. The diamond poset, denoted $B_{2}$, is defined on four elements $x,y,z,w$ with the relations $x<y,z$ and $y,z<w$.…

Combinatorics · Mathematics 2017-11-27 Dániel Grósz , Abhishek Methuku , Casey Tompkins

The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…

Information Theory · Computer Science 2023-09-25 Zhiru Chen , Zhixiong Chen , Jakob Obrovsky , Arne Winterhof

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov