Related papers: Query-Efficient Locally Decodable Codes of Subexpo…

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

Let p>3 be an odd prime and m be a positive integer. Little progress on the study of optimal p-ary cyclic codes with parameters [p^m-1,p^m-2m-2,4] has been made.In this paper, by weakening the necessary and sufficient conditions on cyclic…

In this work we consider the list-decodability and list-recoverability of arbitrary $q$-ary codes, for all integer values of $q\geq 2$. A code is called $(p,L)_q$-list-decodable if every radius $pn$ Hamming ball contains less than $L$…

The $q$-analogue of an integer $m$ is given by $[m]_q=(1-q^m)/(1-q)$. Let $a$ be an integer, and let $n$ be a positive odd integer. Via discrete Fourier transforms, we establish the following two identities:…

Two widely-used computational paradigms for sublinear algorithms are using linear measurements to perform computations on a high dimensional input and using structured queries to access a massive input. Typically, algorithms in the former…

We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can answer the query RMQ(i,j), which returns the index containing…

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…

We use computational method to investigate the number of ways to pack dimers on \emph{odd-by-odd} lattices. In this case, there is always a single vacancy in the lattices. We show that the dimer configuration numbers on $(2k+1) \times…

We study the set $\mathcal{S}$ of odd positive integers $n$ with the property ${2n}/{\sigma(n)} - 1 = 1/x$, for positive integer $x$, i.e., the set that relates to odd perfect and odd "spoof perfect" numbers. As a consequence, we find that…

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

We show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 states (and 2 symbols), is in…

Recent deployments of learned query optimizers use expensive neural networks and ad-hoc search policies. To address these issues, we introduce \textsc{LimeQO}, a framework for offline query optimization leveraging low-rank learning to…

Using Lipman's results on resolution of two-dimensional singularities, we provide a form of resolution of singularities in codimension two for reduced quasi-excellent schemes. We deduce that operations of degree less than two on algebraic…

Recent efforts in coding theory have focused on building codes for insertions and deletions, called insdel codes, with optimal trade-offs between their redundancy and their error-correction capabilities, as well as efficient encoding and…

The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…

We show that if the congruence above holds and $n\mid m$, then the quotient $Q:=m/n$ satisfies $\sum_{p\mid Q} \frac{Q}{p}+1 \equiv 0\pmod{Q}$, where $p$ is prime. The only known solutions of the latter congruence are $Q=1$ and the eight…

Cross-Encoder (CE) and Dual-Encoder (DE) models are two fundamental approaches for query-document relevance in information retrieval. To predict relevance, CE models use joint query-document embeddings, while DE models maintain factorized…

In this paper, we show that the projective Reed-Muller~(PRM) codes form a family of locally correctable codes~(LCC) in the regime of low query complexities. A PRM code is specified by the alphabet size $q$, the number of variables $m$, and…

The range-minimum query (RMQ) problem is a fundamental data structuring task with numerous applications. Despite the fact that succinct solutions with worst-case optimal $2n+o(n)$ bits of space and constant query time are known, it has been…

Let $h_{(m,k)}$ be the class number of $\mathbb{Q}(\sqrt{1-2m^k}).$ We prove that for any odd natural number $k,$ there exists $m_0$ such that $k \mid h_{(m,k)}$ for all odd $m > m_0.$ We also prove that for any odd $m \geq 3,$ $k \mid…