Related papers: On the lexicographic representation of numbers

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…

The (partially) ordered set of the non-trivial zeros of the zeta function with positive imaginary parts is considered. The order is the coordinatewise order inherited from $\mathbb{C}$. Some interesting properties regarding the minimal…

We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than $\omega^2$, then its order type is effectively computable.

Word order, an essential property of natural languages, is injected in Transformer-based neural language models using position encoding. However, recent experiments have shown that explicit position encoding is not always useful, since some…

In this article, we show a new general linear independence criterion related to values of $G$-functions, including the linear independence of values at algebraic points of contiguous hypergeometric functions, which is not known before. Let…

Kaplanski's Zero Divisor Conjecture envisions that for a torsion-free group G and an integral domain R, the group ring R[G] does not contain non-trivial zero divisors. We define the length of an element a in R[G] as the minimal non-negative…

This paper provides some counterexamples to Cantor's contributions to the foundations of Set Theory. The first counterexample forces Cantor's Diagonal Method (DM) to yield one of the numbers in the target list. To study this anomaly, and…

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d$ with $d$ at least $3$ and let $r$ denote the largest degree of an irreducible factor of $F$ over the rationals. Let $k$ be an integer with $k \geq 2$…

Let k be a positive integer and let f be a map from V(G) to the set of all subsets of {1,2,3,...,k}. The function f is called a k-rainbow dominating function of G provided that whenever u is a vertex of G such that f(u) is the empty set,…

Let $\ell$ be a prime, $k$ a finitely generated field of characteristic different from $\ell$, and $X$ a smooth geometrically connected curve over $k$. Say a semisimple representation of $\pi_1^{\mathrm{et}}(X_{\bar k})$ is arithmetic if it…

In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications. These justifications are expressed in terms of causal graphs…

We introduce a uniform representation of general objects that captures the regularities with respect to their structure. It allows a representation of a general class of objects including geometric patterns and images in a sparse, modular,…

Compositional generalization, the ability to recognize familiar parts in novel contexts, is a defining property of intelligent systems. Although modern models are trained on massive datasets, they still cover only a tiny fraction of the…

Cameron introduced a bijection between the set of sum-free sets and the set of all zero-one sequences. In this paper, we study the sum-free sets of natural numbers corresponding to certain zero-one sequences which contain the Cantor-like…

Let $-D < -4$ denote a fundamental discriminant which is either odd or divisible by 8, so that the canonical Hecke character of $\Bbb Q(\sqrt{-D})$ exists. Let $d$ be a fundamental discriminant prime to $D$. Let $2k-1$ be an odd natural…

We explore a well-known integral representation of the logarithmic function, and demonstrate its usefulness in obtaining compact, easily-computable exact formulas for quantities that involve expectations and higher moments of the logarithm…

Answering affirmatively a 2007 problem of Chen, the first author proved that there is a unique representation basis $A$ of $\mathbb{Z}$ and a constant $c>0$ such that $$ A(-x,x)\ge c\sqrt{x} $$ for infinitely many positive integers $x$,…

This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of…

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…