Related papers: The Discrepancy of the Lex-Least De Bruijn Sequenc…
The main interest of this paper is to study the relationship between the low-discrepancy sequence and the static solution to the multi-bodies problem in high-dimensional space. An assumption that the static solution to the multi-bodies…
Despite strong performance on a variety of tasks, neural sequence models trained with maximum likelihood have been shown to exhibit issues such as length bias and degenerate repetition. We study the related issue of receiving…
We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has been conjectured that the shortest…
For any $n>1$ and $0<\varepsilon<1/2$, we show the existence of an $n^{O(1)}$-point subset $X$ of $\mathbb{R}^n$ such that any linear map from $(X,\ell_2)$ to $\ell_2^m$ with distortion at most $1+\varepsilon$ must have $m = \Omega(\min\{n,…
We find the lexicographically least infinite binary rich word having critical exponent $2+\sqrt{2}/2$
In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…
The determinant lower bound of Lovasz, Spencer, and Vesztergombi [European Journal of Combinatorics, 1986] is a powerful general way to prove lower bounds on the hereditary discrepancy of a set system. In their paper, Lovasz, Spencer, and…
Neutrinoless double beta decay, lepton number violating collider processes and the Baryon Asymmetry of the Universe (BAU) are intimately related. In particular lepton number violating processes at low energies in combination with sphaleron…
This paper formulates the Nash problem for a pair consisting of a toric variety and an invariant ideal and gives an affirmative answer to the problem. We also prove that the minimal log-discrepacy is computed by a divisor corresponding to a…
We consider codes over fixed alphabets against worst-case symbol deletions. For any fixed $k \ge 2$, we construct a family of codes over alphabet of size $k$ with positive rate, which allow efficient recovery from a worst-case deletion…
Let $p_n$ denote the $n$th smallest prime number, and let $\boldsymbol{L}$ denote the set of limit points of the sequence $\{(p_{n+1} - p_n)/\log p_n\}_{n = 1}^{\infty}$ of normalized differences between consecutive primes. We show that for…
In this paper we define a new problem, motivated by computational biology, $LCSk$ aiming at finding the maximal number of $k$ length $substrings$, matching in both input strings while preserving their order of appearance. The traditional…
In this paper we show discrepancy bounds for index-transformed uniformly distributed sequences. From a general result we deduce very tight lower and upper bounds on the discrepancy of index-transformed van der Corput-, Halton-, and…
We study the duplication with transposition distance between strings of length $n$ over a $q$-ary alphabet and their roots. In other words, we investigate the number of duplication operations of the form $x = (abcd) \to y = (abcbd)$, where…
Consider communication over the binary erasure channel BEC using random low-density parity-check codes with finite-blocklength n from `standard' ensembles. We show that large error events is conveniently described within a scaling theory,…
For an integer $k\geq 2$, let $(L_{n}^{(k)})_{n}$ be the $k-$generalized Lucas sequence which starts with $0,\ldots,0,2,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we find all the integers…
Starting with Aharoni and Linial in 1986, the deficiency delta(F) = c(F) - n(F) >= 1 for minimally unsatisfiable clause-sets F, the difference of the number of clauses and the number of variables, is playing an important role in…
We present several new results involving $\Delta(x+U)-\Delta(x)$, where $U = o(x)$ and $$ \Delta(x):=\sum_{n\le x}d(n)-x\log x-(2\gamma-1)x $$ is the error term in the classical Dirichlet divisor problem.
Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories -- based on the data structures which…
Recently Alexandersson and Getachew proved some multivariate generalizations of a formula for enumerating signed excedances in derangements. In this paper we first relate their work to a recent continued fraction for permutations and…