Related papers: On sporadic sequences

We prove that the Alexander polynomials of certain families of alternating 4-braid knots satisfy Fox's Trapezoidal Conjecture. Moreover, we give explicit formulas for the signature and for the first 4 coefficients of the Alexander…

In this paper, we prove two congruences on the double sums of the super Catalan numbers (named by Gessel), which were recently conjectured by Apagodu.

We show that on $\mathbb S^1(1/\sqrt{d-2})\times\mathbb S^{d-1}(1)$ the conformally invariant Sobolev inequality holds with a remainder term that is the fourth power of the distance to the optimizers. The fourth power is best possible. This…

We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and explicit their connection to the `kneading sequence' of the polynomial. We then give recursive presentations by generators and…

We consider Chebyshev polynomials, $T_n(z)$, for infinite, compact sets $\frak{e} \subset \mathbb{R}$ (that is, the monic polynomials minimizing the sup-norm, $\Vert T_n \Vert_{\frak{e}}$, on $\frak{e}$). We resolve a $45+$ year old…

With the aid of Hensel Lemma, we refine the 2-adic Newton polygon algorithm proposed by Magron, Koprowski, and Vaccon at ISSAC 2023 to express computationally a given positive univariate polynomial with rational coefficients as a sum of…

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…

We give a simple condition for a linear recurrence (mod 2^w) of degree r to have the maximal possible period 2^(w-1).(2^r-1). It follows that the period is maximal in the cases of interest for pseudo-random number generation, i.e. for…

We refine results of Gannon [G21, Theorem 4.7] and Simon [S15a, Lemma 2.8] on equivalences of convergent Morley sequences. We then introduce the notion of eventual $NIP$, as a property of a model, and give a variant of [KP18, Corollary…

The classical Szeg\H{o}-Verblunsky theorem relates integrability of the logarithm of the absolutely continuous part of a probability measure on the circle to square summability of the sequence of recurrence coefficients for the orthogonal…

We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…

This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…

In this article, the 2-iterated Sheffer polynomials are introduced by means of generating function and operational representation. Using the theory of Riordan arrays and relations between the Sheffer sequences and Riordan arrays, a…

We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.

We prove a biadjoint triangle theorem and its strict version, which are $2$-dimensional analogues of the adjoint triangle theorem of Dubuc. Similarly to the $1$-dimensional case, we demonstrate how we can apply our results to get the…

The graded cellularity of Libedinsky Double Leaves, which form a basis for the endomorphism ring of the Bott_Samelson_Soergel bimodules, allows us to view the Kazhdan_Lusztig polynomials as graded decomposition numbers. Using this point of…

We consider the almost sure asymptotic behavior of the periodogram of stationary and ergodic sequences. Under mild conditions we establish that the limsup of the periodogram properly normalized identifies almost surely the spectral density…

The purpose of this note is to provide a transparent and unified retelling of both Skvortsov's proof of the structural completeness of Medvedev's logic of finite problems, which is a classical result originally due to Prucnal, and of…

We propose a new approach at Fermat's Last Theorem (FLT) solution: for each FLT equation we associate a polynomial of the same degree. The study of the roots of the polynomial allows us to investigate the FLT validity. This technique,…

In this note we present a proof of multiple recurrence for ergodic systems (and thereby of Szemer\'edi's theorem) being a mixture of three known proofs. It is based on a conditional version of the Jacobs-de Leeuw-Glicksberg decomposition…