相关论文: A short proof of Mathar's 2013 recurrence conjectu…

In the work we have considered p-adic functional series with binomial coefficients and discussed its p-adic convergence. Then we have derived a recurrence relation following with a summation formula which is invariant for rational argument.…

This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…

We prove that every 3-coloring of the edges of the complete graph on n vertices without a rainbow triangle contains a set of order Omega(n^{1/3}log^2 n) which uses at most two colors, and this bound is tight up to a constant factor. This…

On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…

In this paper, we investigate the 2-adic valuations of the Stirling numbers $S(n, k)$ of the second kind. We show that $v_2(S(4i, 5))=v_2(S(4i+3, 5))$ if and only if $i\not\equiv 7\pmod {32}$. This confirms a conjecture of Amdeberhan, Manna…

The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…

We study the Andrews-Schilling-Warnaar sum-sides for the principal characters of standard (i.e., integrable, highest weight) modules of $\mathrm{A}_2^{(1)}$. These characters have been studied recently by various subsets of Corteel, Dousse,…

We refine a uniform algebraic approach for deriving upper bounds on reset thresholds of synchronizing automata. We express the condition that an automaton is synchronizing in terms of linear algebra, and obtain upper bounds for the reset…

For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…

We revisit Euler's partition function recurrence, which asserts, for integers $n\geq 1,$ that $$ p(n)=p(n-1)+p(n-2)-p(n-5)-p(n-7)+\dots = \sum_{k\in \mathbb{Z}\setminus \{0\}} (-1)^{k+1} p(n-\omega(k)), $$ where $\omega(m):=(3m^2+m)/2$ is…

Ordinary orthogonal polynomials are uniquely characterized by the three term recurrence relations up to an overall multiplicative constant. We show that the newly discovered M-indexed orthogonal polynomials satisfy 3+2M term recurrence…

We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain…

We give deterministic black-box polynomial identity testing algorithms for multilinear read-once oblivious algebraic branching programs (ROABPs), in n^(lg^2 n) time. Further, our algorithm is oblivious to the order of the variables. This is…

It is well known that the derangement numbers $d_n$, which count permutations of length $n$ with no fixed points, satisfy the recurrence $d_n=nd_{n-1}+(-1)^n$ for $n\ge1$. Combinatorial proofs of this formula have been given by Remmel,…

Let $r(n,k)$ (resp. $s(n,k)$) be the number of Schr\"oder paths (resp. little Schr\"oder paths) of length $2n$ with $k$ hills, and set $r(0,0)=s(0,0)=1$. We bijectively establish the following recurrence relations: \begin{align*}…

An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $\mu (n)$ is introduced by two simple ways. With this recursive relation, $\mu (n)$ can be calculated without directly knowing the factorization of the $n$. $\mu (1)…

Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…

In this work, orthogonal polynomials satisfying $R_I$ type recurrence relation %$\mathcal{P}_{n+1}(z) = (z-c_n)\mathcal{P}_n(z)-\lambda_n (z-a_n)\mathcal{P}_{n-1}(z),$ with $\mathcal{P}_{-1}(z) = 0$ and $\mathcal{P}_0(z) = 1$ are analyzed…

A regular language $L$ is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jir\'askov\'a derived upper bounds on the state complexity of boolean…

Trace reconstruction is the problem of learning an unknown string $x$ from independent traces of $x$, where traces are generated by independently deleting each bit of $x$ with some deletion probability $q$. In this paper, we initiate the…