Related papers: Turan's method and compressive sampling

Let $\theta $ be a Salem number and $P(x)$ a polynomial with integer coefficients. It is well-known that the sequence $(\theta^n)$ modulo 1 is dense but not uniformly distributed. In this article we discuss the sequence $(P(\theta^n))$…

We develop a new technique that allows us to show in a unified way that many well-known combinatorial theorems, including Tur\'an's theorem, Szemer\'edi's theorem and Ramsey's theorem, hold almost surely inside sparse random sets. For…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Using T(m,n;k) to denote the number of ways to make a selection of k squares from an (m x n) rectangular grid with no two squares in the selection adjacent, we give a formula for T(2,n;k), prove some identities satisfied by these numbers,…

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…

A cyclic urn is an urn model for balls of types $0,\ldots,m-1$ where in each draw the ball drawn, say of type $j$, is returned to the urn together with a new ball of type $j+1 \mod m$. The case $m=2$ is the well-known Friedman urn. The…

In learning theory, a standard assumption is that the data is generated from a finite mixture model. But what happens when the number of components is not known in advance? The problem of estimating the number of components, also called…

We consider the problem of "algebraic reconstruction" of linear combinations of shifts of several known signals $f_1,\ldots,f_k$ from the Fourier samples. Following \cite{Bat.Sar.Yom2}, for each $j=1,\ldots,k$ we choose sampling set $S_j$…

In 1939 P. Tur\'an started to derive lower estimations on the norm of the derivatives of polynomials of (maximum) norm 1 on $I:=[-1,1]$ (interval) and $D:=\{z\in\mathbb{C}~:~|z|\le 1\}$ (disk), under the normalization condition that the…

We consider random mappings on n = kr nodes with preimage sizes restricted to a set of the form {0,k}, where k = k(r) is greater than 1. We prove that T, the least common multiple of the cycle lengths, and B= the product of the cycle…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

The polynomials $p_n$ orthogonal on the interval $[-1,1],$ normalized by $p_n(1)=1,$ satisfy Tur\'an's inequality if $p_n^2(x)-p_{n-1}(x)p_{n+1}(x)\ge 0$ for $n\ge 1$ and for all $x$ in the interval of orthogonality. We give a general…

Previously, the author introduced quasirandom permutations, permutations of $\mathbb{Z}_n$ which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly…

An $n$-ary integral quadratic form is a formal expression $Q(x_1,...,x_n)=\sum_{1\leq i,j\leq n}a_{ij}x_ix_j$ in $n$-variables $x_1,...,x_n$, where $a_{ij}=a_{ji} \in \mathbb{Z}$. We present a poly$(n,k, \log p, \log t)$ randomized…

A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open…

We explore the probability that a permutation sampled from the symmetric group of order n uniformly at random has cycles of lengths not exceeding r. Asymptotic formulas valid in specified regions for the ratio n/r are obtained using the…

The problem of calculating the frequencies of network motifs on three and four nodes in large networks is considered. Telecommunications networks, cell molecular networks are investigated. The sizes of the investigated networks are hundreds…

We use Turan type inequalities to give new non-asymptotic bounds on the extreme zeros of orthogonal polynomials in terms of the coefficients of their three term recurrence. Most of our results deal with symmetric polynomials satisfying the…

We investigate the behavior of some thin sets of integers defined through random trigonometric polynomial when one replaces Gaussian or Rademacher variables by p-stable ones, with 1 < p < 2. We show that in one case this behavior is…