Related papers: A $\Pi^0_2$ Singleton of Minimal Arithmetic Degree
The connection between self-assembly and computation suggests that a shape can be considered the output of a self-assembly ``program,'' a set of tiles that fit together to create a shape. It seems plausible that the size of the smallest…
Much of arithmetic geometry is concerned with the study of principal bundles. They occur prominently in the arithmetic of elliptic curves and, more recently, in the study of the Diophantine geometry of curves of higher genus. In particular,…
We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…
A formalism of arithmetic partial differential equations (PDEs) is being developed in which one considers several arithmetic differentiations at one fixed prime. In this theory solutions can be defined in algebraically closed p-adic fields.…
In this paper we analyze the relationship between o-minimal structures and the notion of \omega -saturated one dimensional t.t.t structures. We prove that if removing any point from such a structure splits it into more than one definably…
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of finding representations with minimal weight has been solved…
We construct the smallest Ree-Tits unital from a group of matrices that is isomorphic to the commutator group of the corresponding Ree group. The matrix description is used to determine configurations in the unital via explicit…
Separation logic is successful for software verification of heap-manipulating programs. Numbers are necessary to be added to separation logic for verification of practical software where numbers are important. However, properties of the…
Self-organization of robust and efficient networks is important for a future design of communication or transportation systems, because both characteristics are not coexisting in many real networks. As one of the candidates for the…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
Let R be a local Cohen-Macaulay ring with canonical module \omega_R. We investigate the following question of Huneke: If the sequence of Betti numbers \{\beta_i^R(\omega_R)\} has polynomial growth, must R be Gorenstein? This question is…
We establish the relative minimal model program with scaling for locally projective morphisms of quasi-excellent algebraic spaces admitting dualizing complexes, quasi-excellent formal schemes admitting dualizing complexes, semianalytic…
Answering a question of Junker and Ziegler, we construct a countable first order structure which is not omega-categorical, but does not have any proper non-trivial reducts, in either of two senses (model-theoretic, and group-theoretic). We…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
The fluctuation of dynamic variables in complex networks is known to depend on the dimension and the heterogeneity of the substrate networks. Previous studies, however, have reported inconsistent results for the scaling behavior of…
In this paper we propose a general method for computing a minimal free right resolution of a finitely presented graded right module over a finitely presented graded noncommutative algebra. In particular, if such module is the base field of…
The individual terms of the series representing the Riemann zeta function are examined geometrically from their accumulated plot in the complex plane. Symmetry is identified and determined mathematically for comparison with more traditional…
We study computably enumerable equivalence relations (abbreviated as ceers) under computable reducibility, and we investigate the resulting degree structure Ceers, which is a poset with a smallest and a greatest element. We point out a…
We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e.…
With the rapid rise of generative AI in higher education and the unreliability of current AI detection tools, developing policies that encourage student learning and critical thinking has become increasingly important. This study examines…