Related papers: On finite sequences satisfying linear recursions
Suppose that $(U_{n})_{n \geq 0}$ is a binary recurrence sequence and has a dominant root $\alpha$ with $\alpha>1$ and the discriminant $D$ is square-free. In this paper, we study the Diophantine equation $U_n + U_m = x^q$ in integers $n…
A binary vector of length $N$ has elements that are either 0 or 1. We investigate the question of whether and how a binary vector of known length can be reconstructed from a limited set of its discrete Fourier transform (DFT) coefficients.…
We design a class of Chudnovsky-type algorithms multiplying k elements of a finite extension of order n a finite field K. We prove that these algorithms give a tensor decomposition of the k-multiplication for which the rank is linear in n…
Motivated by the constructions of binary sequences by utilizing the cyclic elliptic function fields over the finite field $\mathbb{F}_{2^{n}}$ by Jin \textit{et al.} in [IEEE Trans. Inf. Theory 71(8), 2025], we extend the construction to…
The classical Hard Lefschetz theorem (HLT), Hodge-Riemann bilinear relation theorem (HRR) and Lefschetz decomposition theorem (LD) are stated for a power of a K\"ahler class on a compact K\"ahler manifold. These theorems are not true for an…
This paper is devoted to investigating the sequence of some linear functionals in the space $BV$ of finite variation functions. We prove that under certain conditions this sequence is bounded. We also prove that this result is sharp. In…
Let $\mathbb{F}_q$ be the finite field of order $q$ and $E\subset \mathbb{F}_q^d$, where $4|d$. Using Fourier analytic techniques, we prove that if $|E|>\frac{q^{d-1}}{d}\binom{d}{d/2}\binom{d/2}{d/4}$, then the points of $E$ determine a…
Starting with a quaternion difference equation with boundary conditions, a parameterized sequence which is complete in finite dimensional quaternion Hilbert space is derived. By employing the parameterized sequence as the kernel of discrete…
Linear statistics, a random variable build out of the sum of the evaluation of functions at the eigenvalues of a N times N random matrix,sum[j=1 to N]f(xj) or tr f(M), is an ubiquitous statistical characteristics in random matrix theory.…
Given any pair of positive integers m and n, we construct a new Hopf algebra, which may be regarded as a degenerate version of the quantum group of gl(m+n). We study its structure and develop a highest weight representation theory. The…
Since the seminal work of Keating and Snaith, the characteristic polynomial of a random Haar-distributed unitary matrix has seen several of its functional studied or turned into a conjecture; for instance: $ \bullet $ its value in $1$…
We prove some infinite series identities for the Hermite functions. From these identities we disprove the Gabor frame set conjecture for Hermite functions of order $4m+2$ and $4m+3$ for $m \in \{0\} \cup \mathbb{N}$. The results hold not…
Consider an $n \times n$ non-Hermitian random matrix $M_n$ whose entries are independent real random variables. Under suitable conditions on the entries, we study the fluctuations of the entries of $f(M_n)$ as $n$ tends to infinity, where…
We study linear functions on the space of $n \times n$ matrices over a field which preserve or strongly preserve each of Green's equivalence relations ($\mathcal{L}$, $\mathcal{R}$, $\mathcal{H}$ and $\mathcal{J}$) and the corresponding…
We give a new proof of the Hansen-Mullen irreducibility conjecture. The proof relies on an application of a (seemingly new) sufficient condition for the existence of elements of degree $n$ in the support of functions on finite fields. This…
Lehmer constructs four classes of matrices constructed from roots of unity for which the characteristic polynomials and the $k$-th powers can be determined explicitly. Here we study a class of matrices which arise naturally in…
Sequence classification has numerous applications in various fields. Despite extensive studies in the last decades, many challenges still exist, particularly in pattern-based methods. Existing pattern-based methods measure the…
For a real sequence of length of m = nl, we may deduce its congruence derivative sequence with length of l. The discrete Fourier transform of original sequence can be calculated by the discrete Fourier transform of the congruence derivative…
A Heffter array $H(m,n;s,t)$ is an $m \times n$ matrix with nonzero entries from $\mathbb{Z}_{2ms+1}$ such that $i)$ each row contains $s$ filled cells and each column contains $t$ filled cells, $ii)$ every row and column sum to 0, and…
An n\times n matrix M is called a fooling-set matrix of size n, if its diagonal entries are nonzero, whereas for every k\ne \ell we have M_{k,\ell} M_{\ell,k} = 0. Dietzfelbinger, Hromkovi\v{c}, and Schnitger (1996) showed that n \le (\rk…