相关论文: Multiple-Size Divide-and-Conquer Recurrences

For every $a\geq1$ we give a recursion algorithm of building of set of solutions of equations of the form $t(x+a)=t(x)$ and $t(x+a)=1-t(x),$ where $\{t(n)\}$ is Thue-Morse sequence. We pose an open problem and two conjectures.

The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…

Zeckendorf's Theorem states that every positive integer can be uniquely represented as a sum of non-adjacent Fibonacci numbers, indexed from $1, 2, 3, 5,\ldots$. This has been generalized by many authors, in particular to constant…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

We consider some bilinear recurrences that have applications in number theory. The explicit solution of a general three-term bilinear recurrence relation of fourth order is given in terms of the Weierstrass sigma function for an associated…

Turyn-type sequences, TT(n), are quadruples of {+,-1}-sequences (A;B;C;D), with lengths n,n,n,n-1 respectively, where the sum of the nonperiodic autocorrelation functions of A,B and twice that of C,D is a delta-function (i.e., vanishes…

Consider multiple sums $S_n$ on the $d$-dimensional integer grid,which are generated by i.i.d.\ random variables with a positive expectation. We prove the strong law of large numbers, the law of the iterated logarithm and the distributional…

We establish multiple recurrence results for pretentious measure-preserving multiplicative actions along generalized Pythagorean triples, that is, solutions to the equation $ax^2 + b y^2 = c z^2$. This confirms the ergodic-theoretic form of…

Transseries expansions build upon ordinary power series methods by including additional basis elements such as exponentials and logarithms. Alternative summation methods can then be used to "resum" series to obtain more efficient…

It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…

Let $D(n)$ be the number of pairwise disjoint Steiner quadruple systems. A simple counting argument shows that $D(n) \leq n-3$ and a set of $n-3$ such systems is called a large set. No nontrivial large set was constructed yet, although it…

Pisot sequences (sequences $a_n$ with initial terms $a_0=x, a_1=y$, and defined for $n>1$ by $a_n= \lfloor a_{n-1}^2/a_{n-2} + \frac{1}{2} \rfloor$) often satisfy linear recurrences with constant coefficients that are valid for all $n \geq…

A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of…

The resurgence and asymptotic resurgence of an ideal in a polynomial ring are two statistics which measure the relationship between its regular and symbolic powers. We address two aspects of resurgence which can be studied via asymptotic…

In this paper we study the asymptotic behavior of the number of summands in tensor products of finite dimensional representations of affine (semi)group (super)schemes and related objects.

This paper studies hypothesis testing and parameter estimation in the context of the divide and conquer algorithm. In a unified likelihood based framework, we propose new test statistics and point estimators obtained by aggregating various…

If you take a superposition of n IID copies of a point process and thin that by a factor of 1/n, then the resulting process tends to a Poisson point process as n tends to infinity. We give a simple proof of this result that highlights its…

Turan's method, as expressed in his books, is a careful study of trigonometric polynomials from different points of view. The present article starts from a problem asked by Turan: how to construct a sequence of real numbers x(j) (j=…

We study linear recurrences of Eulerian type of the form \[ P_n(v) = (\alpha(v)n+\gamma(v))P_{n-1}(v) +\beta(v)(1-v)P_{n-1}'(v)\qquad(n\ge1), \] with $P_0(v)$ given, where $\alpha(v), \beta(v)$ and $\gamma(v)$ are in most cases polynomials…

We present a recursive construction of a (2t + 1)-wise uniform set of permutations on 2n objects using a (2t + 1) - (2n, n, \cdot) combinatorial design, a t-wise uniform set of permutations on n objects and a (2t+1)-wise uniform set of…