English
Related papers

Related papers: Some explorations on two conjectures about Rademac…

200 papers

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

Combinatorics · Mathematics 2026-03-31 Verónica Borrás-Serrano , Isabel Byrne , Anant Godbole , Nathaniel Veimau

Seymour's Second-Neighborhood Conjecture states that every directed graph whose underlying graph is simple has at least one vertex $v$ such that the number of vertices of out-distance $2$ from $v$ is at least as large as the number of…

Combinatorics · Mathematics 2019-07-31 Farid Bouya , Bogdan Oporowski

We compare ordinary and symmetric variants of two classical measures of pseudorandomness for binary sequences, the $2$-adic complexity and the linear complexity. In the periodic setting, we show that for binary periodic sequences…

Number Theory · Mathematics 2026-03-25 Yixin Ren , Arne Winterhof

Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive.…

Combinatorics · Mathematics 2015-05-26 Scott Garrabrant , Igor Pak

In this paper we announce a conjecture concerning enumeration of n-times persymmetric matrices over F_2 by rank. To justify our statement we remark that the formulas obtained are valid for n equal to one, two and three.

Combinatorics · Mathematics 2009-09-23 Jorgen Cherly

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

Number Theory · Mathematics 2014-01-31 Caixia Shen , Li-meng Xia

In this article we study the pair correlation statistic for higher dimensional sequences. We show that for any $d\geq 2$, strictly increasing sequences $(a_n^{(1)}),\ldots, (a_n^{(d)})$ of natural numbers have metric Poissonian pair…

Number Theory · Mathematics 2023-08-21 Tanmoy Bera , Mithun Kumar Das , Anirban Mukhopadhyay

Let $R(n) = \sum_{a+b=n} \Lambda(a)\Lambda(b)$, where $\Lambda(\cdot)$ is the von Mangoldt function. The function $R(n)$ is often studied in connection with Goldbach's conjecture. On the Riemann hypothesis (RH) it is known that $\sum_{n\leq…

Number Theory · Mathematics 2020-06-29 Michael J. Mossinghoff , Timothy S. Trudgian

Let B denote an arbitrary Banach space, G a compact abelian group with Haar measure $\mu$ and dual group $\Gamma$. Let E be a Sidon subset of $\Gamma$ with Sidon constant S(E). Let r_n denote the n-th Rademacher function on [0, 1]. We show…

Functional Analysis · Mathematics 2008-02-03 Nakhlé Asmar , Stephen J. Montgomery-Smith

Let BS(m,n) denote the set of base sequences (A;B;C;D), with A and B of length m and C and D of length n. The base sequence conjecture (BSC) asserts that BS(n+1,n) exist (i.e., are non-empty) for all n. This is known to be true for n <= 36…

Combinatorics · Mathematics 2010-04-27 Dragomir Z. Djokovic

A sequence $(x_n)_{n=1}^{\infty}$ on the torus $\mathbb{T} \cong [0,1]$ is said to exhibit Poissonian pair correlation if the local gaps behave like the gaps of a Poisson random variable, i.e. $$ \lim_{N \rightarrow \infty}{ \frac{1}{N} \#…

Number Theory · Mathematics 2017-11-08 Stefan Steinerberger

In 1951 paper \cite{Ki} Kippenhahn conjectured that if the characteristic polynomial \ $P_A(x_1,x_2,x_3)=\mbox{det}(x_1A_1+x_2A_2-x_3I)$, \ where $A_1$ and $A_2$ are $n\times n$ Hermitian matrices, has a repeated factor in the polynomial…

Functional Analysis · Mathematics 2026-03-11 Michael Stessin

Let $G$ be a finite cyclic group of order $n \ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot ... \cdot (n_lg)$ where $g\in G$ and $n_1,..., n_l \in [1,\ord(g)]$, and the index $\ind (S)$ of $S$ is defined as…

Combinatorics · Mathematics 2011-03-14 Weidong Gao , Yuanlin Li , Jiangtao Peng , Chris Plyley , Guoqing Wang

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

General Mathematics · Mathematics 2026-01-23 Edwige Tolla

Given a nonnegative function $\psi : \N \to \R $, let $W(\psi)$ denote the set of real numbers $x$ such that $|nx -a| < \psi(n) $ for infinitely many reduced rationals $a/n (n>0) $. A consequence of our main result is that $W(\psi)$ is of…

Number Theory · Mathematics 2009-03-20 Alan Haynes , Andrew Pollington , Sanju Velani

In this work we review and derive some elementary properties of the discrete renewal sequences based on a positive, finite and integer-valued random variable. Our results consider these sequences as dependent on the probability masses of…

Probability · Mathematics 2024-05-28 Nikolai Nikolov , Mladen Savov

The Ramanujan Machine project predicts new continued fraction representations of numbers expressed by important mathematical constants. Generally, the value of a continued fraction is found by reducing it to a second order linear difference…

Classical Analysis and ODEs · Mathematics 2024-03-18 Shuma Yamamoto

We study the class of rational recursive sequences (ratrec) over the rational numbers. A ratrec sequence is defined via a system of sequences using mutually recursive equations of depth 1, where the next values are computed as rational…

Formal Languages and Automata Theory · Computer Science 2022-10-05 Lorenzo Clemente , Maria Donten-Bury , Filip Mazowiecki , Michał Pilipczuk

In this paper we prove that $\mathbb{P}(|X| \geq \sqrt{\text{Var}(X)}) \geq 7/32$ for every finite Rademacher sum $X$, confirming a conjecture by Hitczenko and Kwapie{\'n} from 1994, and improving upon results from Burkholder, Oleszkiewicz,…

Combinatorics · Mathematics 2023-06-14 Lawrence Hollom , Julien Portier

Collatz Conjecture sequences increase and decrease in seemingly random fashion. By identifying and analyzing the forms of numbers, we discover that Collatz sequences are governed by very specific, well-defined rules, which we call cascades.

General Mathematics · Mathematics 2022-09-14 H. Nelson Crooks , Chigozie Nwoke
‹ Prev 1 4 5 6 7 8 10 Next ›