Related papers: Encoding Sets as Real Numbers (Extended version)
In this letter, we consider a problem of reconstructing an unknown discrete signal taking values in a finite alphabet from incomplete linear measurements. The difficulty of this problem is that the computational complexity of the…
By means of partial fraction method, we investigate the decomposition of rational functions. Several striking identities on harmonic numbers and generalized Apery numbers will be established, including the binomial-harmonic number identity…
We study representations of integers as sums of the form $\pm a_1\pm a_2\pm \dotsb \pm a_n$, where $a_1,a_2,\ldots$ is a prescribed sequence of integers. Such a sequence is called an Erd\H{o}s-Sur\'anyi sequence if every integer can be…
We propose an unsupervised hashing method which aims to produce binary codes that preserve the ranking induced by a real-valued representation. Such compact hash codes enable the complete elimination of real-valued feature storage and allow…
Let $f(n)$ be an arithmetic function with $f(n) \ll n^\alpha$ for some $\alpha\in[0,1)$ and let $\lfloor .\rfloor $ denote the integer part function. In this paper, we evaluate asymptotically the sums $$\sum_{n_{1}n_{2}\leq x}f \left(…
In this paper, we present ASPEN, an answer set programming (ASP) implementation of a recently proposed declarative framework for collective entity resolution (ER). While an ASP encoding had been previously suggested, several practical…
Transformer-based language models often achieve strong results on mathematical reasoning benchmarks while remaining fragile on basic numerical understanding and arithmetic operations. A central limitation is that numbers are processed as…
We explore a conjecture posed by Eswarathasan and Levine on the distribution of $p$-adic valuations of harmonic numbers $H(n)=1+1/2+\cdots+1/n$ that states that the set $J_p$ of the positive integers $n$ such that $p$ divides the numerator…
Arbitrary high order numerical methods for time-harmonic acoustic scattering problems originally defined on unbounded domains are constructed. This is done by coupling recently developed high order local absorbing boundary conditions (ABCs)…
A set $A$ is MSTD (more-sum-than-difference) if $|A+A|>|A-A|$. Though MSTD sets are rare, Martin and O'Bryant proved that there exists a positive constant lower bound for the proportion of MSTD subsets of $\{1,2,\ldots ,r\}$ as…
Most existing Neural Machine Translation models use groups of characters or whole words as their unit of input and output. We propose a model with a hierarchical char2word encoder, that takes individual characters both as input and output.…
We analyze a weighted convolution of Catalan numbers $$ \sum_{k=0}^{n} \binom{2k}{k}\binom{2(n-k)}{n-k} a^k = \sum_{k=0}^{n} (k+1)(n-k+1) C_k C_{n-k} a^k, $$ emphasizing its combinatorial, analytic, and probabilistic aspects. We derive a…
This study focuses on efficient schemes for enumerative coding of $\sigma$--ary sequences by mainly borrowing ideas from \"Oktem & Astola's \cite{Oktem99} hierarchical enumerative coding and Schalkwijk's \cite{Schalkwijk72} asymptotically…
Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…
For a half-integral weight modular form $f = \sum_{n=1}^{\infty} a_f(n)n^{\frac{k-1}{2}} q^n$ of weight $k = l +\frac{1}{2}$ on $\Gamma_0(4)$ such that $a_f(n)$ ($n$ $\in$ $\mathbb{N}$) are real, we prove for a fixed suitable natural number…
Neural extractive summarization models usually employ a hierarchical encoder for document encoding and they are trained using sentence-level labels, which are created heuristically using rule-based methods. Training the hierarchical encoder…
We construct the Lafforgue variety, an affine scheme equipped with an open dense subscheme parametrizing the simple modules of a non-commutative unital algebra $R$ over any field $k$, provided that the center $Z(R)$ is finitely generated…
For integer $k \geq 1$, let $S_k(n)$ denote the sum of the $k$th powers of the first $n$ positive integers. In this paper, we derive a new formula expressing $2^{2k}$ times $S_{2k}(n)$ as a sum of $k$ terms involving the numbers in the…
Let $\mathcal{A}$ be a finite set of integers, and let $h\mathcal{A}$ denote the $h$-fold sumset of $\mathcal{A}$. Let $(h\mathcal{A})^{(t)}$ be subset of $h\mathcal{A}$ consisting of all integers that have at least $t$ representations as a…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…