Related papers: Non-holonomicity of the sequence $\log 1, \log 2, …

We exhibit a class of Littlewood polynomials that are not $L^\alpha$-flat for any $\alpha \geq 0$. Indeed, it is shown that the sequence of Littlewood polynomials is not $L^\alpha$-flat, $\alpha \geq 0$, when the frequency of $-1$ is not in…

As an application of Szemeredi's regularity lemma, Erdos-Frankl-Rodl (1986) showed that the number of graphs on vertex set {1,2,...n} with a monotone class P is $2^{(1+o(1))ex(n,P)n^2/2}$ where $ex(n,P)$ is the maximum number of edges of an…

The \textit{ternary digits of $2^n$} are a finite sequence of 0s, 1s, and 2s. It is a natural question to ask whether the frequency of any string of 0s, 1s, and 2s in this sequence approaches the same limit for all strings of the same…

Remarks on the Cantor's nondenumerability proof of 1891 that the real numbers are noncountable will be given. By the Cantor's diagonal procedure, it is not possible to build numbers that are different from all numbers in a general assumed…

Let A \subseteq [1,..,N]^2 be a set of cardinality at least N^2/(log log N)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d>0. This theorem is a two-dimensional generalization of…

We answer the question in the title in the negative by providing four proofs.

In a recent proof of the log-concavity of genus polynomials of some families of graphs, Gross et al. defined the weakly synchronicity relation between log-concave sequences, and conjectured that the convolution operation by any log-concave…

We give a short argument showing that if $m, n \in {1, 2, ...} \cup {\omega}$, then the groups mV and nV are not isomorphic. This answers a question of Brin.

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$…

The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

We introduce the notion of logarithmically concave (or log-concave) sequences in Coding Theory. A sequence $a_0, a_1, \dots, a_n$ of real numbers is called log-concave if $a_i^2 \ge a_{i-1}a_{i+1}$ for all $1 \le i \le n-1$. A natural…

Let f be a polynomial over the complex numbers with an isolated singularity at 0. We show that the multiplicity and the log canonical threshold of f at 0 are invariants of the link of f viewed as a contact submanifold of the sphere. This is…

A sequence $\{ a_n \}_{n \ge 0}$ is said to be asymptotically $r$-log-convex if it is $r$-log-convex for $n$ sufficiently large. We present a criterion on the asymptotical $r$-log-convexity based on the asymptotic behavior of $a_n…

A sequence of nonzero integers $f = (f_1, f_2, \dots)$ is ``binomid'' if every $f$-binomid coefficient $\left[\! \begin{array}{c} n \\ k \end{array}\! \right]_f$ is an integer. Those terms are the generalized binomial coefficients: \[…

We study elements of second order linear recurrence sequences $(G_n)_{n= 0}^{\infty}$ of polynomials in $\mathbb{C}[x]$ which are decomposable, i.e. representable as $G_n=g\circ h$ for some $g, h\in \mathbb{C}[x]$ satisfying…

Let $f$ be an $E$-function (in Siegel's sense) not of the form $e^{\beta z}$, $\beta \in \overline{\mathbb{Q}}$, and let $\log$ denote any fixed determination of the complex logarithm. We first prove that there exists a finite set $S(f)$…

One of the earliest and best-known application of the probabilistic method is the proof of existence of a 2 log n$-Ramsey graph, i.e., a graph with n nodes that contains no clique or independent set of size 2 log n. The explicit…

We show that the category of log homotopy types is a full subcategory of a category of homotopy types with modulus.

The Catalan transform of a sequence (a_{n})_{n>=0} is the sequence (b_{n})_{n>=0} with b_{n} = Sum[k/(2n-k) (2n-k)-choose-(n-k) a_{k},k=0..n]. Here we show that the Catalan transform of the Catalan numbers has a simple interpretation: it…