Related papers: On some monotonic combinatorial sequences conjectu…
In recent years, Z.-W. Sun proposed several sophisticated conjectures on congruences for finite sums with terms involving combinatorial sequences such as central trinomial coefficients, Domb numbers and Franel numbers. These sums are double…
Recently Dekking conjectured the form of the subword complexity function for the Fibonacci-Thue-Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.
This is an informal discussion on one of the basic problems in the theory of empirical processes, addressed in our preprint "Combinatorics of random processes and sections of convex bodies", which is available at ArXiV and from our web…
We prove that Anderson's conjecture on symmetric sequencings and Bailey's conjecture on 2-sequencings hold for sufficiently large groups. In addition, we discuss extensions of partial harmonious sequences and partial R-sequencings. Several…
Towards confirming Sun's conjecture on the strict log-concavity of combinatorial sequence involving the n$th$ Bernoulli number, Chen, Guo and Wang proposed a conjecture about the log-concavity of the function…
We present the proofs of the conjectures mentioned in the paper published in the proceedings of the 2024 AAAI conference [1], and discovered by the decomposition methods presented in the same paper.
This paper contains the proof of difference counterparts of the conjectures due to Keven Kadell on symmetric and anti-symmetric Macdonald polynomials.
It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random…
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…
We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
In this paper we prove some new series for $1/\pi$ as well as related congruences. We also raise several new kinds of series for $1/\pi$ and present some related conjectural congruences involving representations of primes by binary…
We prove and generalize several recent conjectures of Z.-W. Sun surrounding binomial coefficients and harmonic numbers. We show that Sun's series and their analogs can be represented as cyclotomic multiple zeta values of levels…
We give a short proof of the inner product conjecture for the symmetric Macdonald polynomials of type $A_{n-1}$. As a special case, the corresponding constant term conjecture is also proved.
The paper studies frequency characteristics and predictability of real sequences, i.e., discrete time processes in deterministic setting. We consider band-limitness and predictability of one-sided sequences. We establish predictability of…
We obtain an explicit combinatorial formula for certain parabolic Kostka-Shoji polynomials associated with the cyclic quiver, generalizing results of Shoji and of Liu and Shoji.
In this paper, a conjecture of Mazur, Rubin and Stein concerning certain averages of modular symbols is proved.
We report on various results, conjectures, and open problems related to Kazhdan-Lusztig polynomials of matroids. We focus on conjectures about the roots of these polynomials, all of which appear here for the first time.
We ask questions generalizing uniform versions of conjectures of Mordell and Lang and combining them with the Morton--Silverman conjecture on preperiodic points. We prove a few results relating different versions of such questions.
In this paper, we partly prove a supercongruence conjectured by Z.-W. Sun in 2013. Let $p$ be an odd prime and let $a\in\mathbb{Z}^{+}$. Then if $p\equiv1\pmod3$, we have \begin{align*}…
We prove that the $abc$-Conjecture implies upper bounds on Zsigmondy sets that are uniform over families of unicritical polynomials over number fields. As an application, we use the $abc$-Conjecture to prove that there exist uniform bounds…