Related papers: A Normality Conjecture on Rational Base Number Sys…
We present an impossibility result, called a theorem about facts and words, which pertains to a general communication system. The theorem states that the number of distinct words used in a finite text is roughly greater than the number of…
The celebrated Primitive Normal Basis Theorem states that for any $n\ge 2$ and any finite field $\mathbb F_q$, there exists an element $\alpha\in \mathbb F_{q^n}$ that is simultaneously primitive and normal over $\mathbb F_q$. In this…
We propose modal Markov logic as an extension of propositional Markov logic to reason under the principle of maximum entropy for modal logics K45, KD45, and S5. Analogous to propositional Markov logic, the knowledge base consists of…
Let $L=(L_d)_{d \in \mathbb N}$ be any ordered probability sequence, i.e., satisfying $0 < L_{d+1} \le L_d$ for each $d \in \mathbb N$ and $\sum_{d \in \mathbb N} L_d =1$. We construct sequences $A = (a_i)_{i \in \mathbb N}$ on the…
In 1991, David Gale and Raphael Robinson, building on explorations carried out by Michael Somos in the 1980s, introduced a three-parameter family of rational recurrence relations, each of which (with suitable initial conditions) appeared to…
In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typed lambda-calculus enriched by pattern-matching…
In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some…
The consideration of nonstandard models of the real numbers and the definition of a qualitative ordering on those models provides a generalization of the principle of maximization of expected utility. It enables the decider to assign…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
A real number is called simply normal to base $b$ if its base-$b$ expansion has each digit appearing with average frequency tending to $1/b$. In this article, we discover a relation between the frequency that the digit $1$ appears in the…
Recently Conrey, Farmer and Zirnbauer conjectured formulas for the averages over a family of ratios of products of shifted L-functions. Their L-functions Ratios Conjecture predicts both the main and lower order terms for many problems,…
In the classical sense, the set B consists of all integers which can be written as a sum of two perfect squares. In other words, these are the values attained by norms of integral ideals over the Gaussian field Q(i). G.J. Rieger (1965) and…
We prove the Kakeya set conjecture for $\mathbb{Z}/N\mathbb{Z}$ for general $N$ as stated by Hickman and Wright [HW18]. This entails extending and combining the techniques of Arsovski [Ars21a] for $N=p^k$ and the author and Dvir [DD21] for…
We present a new recursive generation algorithm for prefix normal words. These are binary strings with the property that no substring has more 1s than the prefix of the same length. The new algorithm uses two operations on binary strings,…
Milnor formulated a conjecture about rational linear independence of some special Hurwitz zeta values. The second and third authors along with Ram Murty studied this conjecture and suggested an extension of Milnor's conjecture. In this…
A famous conjecture of Littlewood (c. 1930) concerns approximating two real numbers by rationals of the same denominator, multiplying the errors. In a lesser-known paper, Wang and Yu (1981) established an asymptotic formula for the number…
Let $\pi(x;q,a)$ denote the number of primes up to $x$ that are congruent to $a$ modulo $q$. A prime number race, for fixed modulus $q$ and residue classes $a_1, \ldots, a_r$, investigates the system of inequalities $\pi(x;q,a_1) >…
A subsequence of a word $w$ is a word $u$ such that $u = w[i_1] w[i_2] \dots w[i_{k}]$, for some set of indices $1 \leq i_1 < i_2 < \dots < i_k \leq \lvert w\rvert$. A word $w$ is $k$-subsequence universal over an alphabet $\Sigma$ if every…
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…
A.A. Suslin proved a normality theorem for an elementary linear group, which says that an elementary linear group of size bigger than or equal to 3 over a commutative ring with unity is normal in the general linear group of same size.…