We show that any $m\times m$ matrix $M$ with integer entries and $\det M =Δ\neq 0$ can be equipped by a finite digit set $\mathcal{D}\subset\mathbb{Z}^m$ such that any integer $m$-dimensional vector belongs to the set $$ {\rm Fin}_{\mathcal{D}}(M)= \Bigl\{\sum_{k\in I}M^k {d}_k : \emptyset\neq I \text{ finite subset of } \mathbb{Z} \text{ and } {d}_k \in \mathcal{D} \text{ for each } k \in I\Bigr\} \subset \bigcup\limits_{k\in \mathbb{N}} \frac{1}{Δ^k}\mathbb{Z}^{m} \,. $$ We also characterize the matrices $M$ for which the sets $ {\rm Fin}_{\mathcal{D}}(M)$ and $ \bigcup\limits_{k\in \mathbb{N}} \frac{1}{Δ^k}\mathbb{Z}^{m}$ coincide.
In this paper, we study representations of real numbers in the positional numeration system with negative basis, as introduced by Ito and Sadahiro. We focus on the set $\Z_{-β}$ of numbers whose representation uses only non-negative powers of $-β$, the so-called $(-β)$-integers. We describe the distances between consecutive elements of $\Z_{-β}$. In case that this set is non-trivial we associate to $β$ an infinite word $\boldsymbol{v}_{-β}$ over an (in general infinite) alphabet. The self-similarity of $\Z_{-β}$, i.e., the property $-β\Z_{-β}\subset \Z_{-β}$, allows us to find a morphism under…
We present a dimension formula for spaces of vector-valued modular forms of integer weight in case the associated multiplier system has finite image, and discuss the weight distribution of the module generators of holomorphic and cusp forms, as well as the duality relation between cusp forms and holomorphic forms for the contragredient.
The explicit formulas of operations, in particular addition and multiplication, of $p $-adic integers are presented. As applications of the results, at first the explicit formulas of operations of Witt vectors with coefficients in $\mathbb{F}_{2}$ are given; then, through solving a problem of Browkin about the transformation between the coefficients of a $p$-adic integer expressed in the ordinary least residue system and the numerically least residue system, similar formulas for Witt vectors with coefficients in $\mathbb{F}_{3}$ are obtained.
We study parallel algorithms for addition of numbers having finite representation in a positional numeration system defined by a base $β$ in $\mathbb{C}$ and a finite digit set $\mathcal{A}$ of contiguous integers containing $0$. For a fixed base $β$, we focus on the question of the size of the alphabet allowing to perform addition in constant time independently of the length of representation of the summands. We produce lower bounds on the size of such alphabet $\mathcal{A}$. For several types of well studied bases (negative integer, complex numbers $ -1 + \imath$, $2 \imath$, and $\imath \sq…
Let $K$ be a complete discrete valued field of characteristic zero with residue field $k_K$ of characteristic $p > 0$. Let $L/K$ be a finite Galois extension with the Galois group $G$ and suppose that the induced extension of residue fields $k_L/k_K$ is separable. In his paper, Hesselholt conjectured that $H^1(G,W(\sO_L))$ is zero, where $\sO_L$ is the ring of integers of $L$ and $W(\sO_L)$ is the Witt ring of $\sO_L$ w.r.t. the prime $p$. He partially proved this conjecture for a large class of extensions. In this paper, we prove Hesselholt's conjecture for all Galois extensions.
Let $F(\boldsymbol x)$ be a homogeneous polynomial in $n \ge 1$ variables of degree $1 \leq d \leq n$ with integer coefficients so that its degree in every variable is equal to $1$. We give some sufficient conditions on $F$ to ensure that for every integer $b$ there exists an integer vector $\boldsymbol a$ such that $F(\boldsymbol a) = b$. The conditions provided also guarantee that the vector $\boldsymbol a$ can be found in a finite number of steps.
Let $K$ be a complete discrete valuation field of characteristic zero with residue field $k_K$ of characteristic $p>0$. Let $L/K$ be a finite Galois extension with Galois group $G=\Gal(L/K)$ and suppose that the induced extension of residue fields $k_L/k_K$ is separable. Let $\mathbb{W}_n(\cdot)$ denote the ring of $p$-typical Witt vectors of length $n$. Hesselholt conjectured that the pro-abelian group $\{H^1(G,\mathbb{W}_n(\mathcal{O}_L))\}_{n\geq 1}$ is isomorphic to zero. Hogadi and Pisolkar have recently provided a proof of this conjecture. In this paper, we provide an alternative proof o…
Let $n$ be a positive integer. We show that a unit rational space vector whose multiple by $n$ is an integer vector can be extended to a rational orthonormal basis whose all members have the same property.
For a subset $S$ of nonnegative integers and a vector $\mathbf{a}=(a_1,\dots,a_k)$ of positive integers, let $V'_S(\mathbf{a})=\{ a_1s_1+\cdots+a_ks_k : s_i\in S\} \setminus \{0\}$. For a positive integer $n$, let $\mathcal T(n)$ be the set of integers greater than or equal to $n$. In this paper, we consider the problem of finding all vectors $\mathbf{a}$ satisfying $V'_S(\mathbf{a})=\mathcal T(n)$, when $S$ is the set of (generalized) $m$-gonal numbers and $n$ is a positive integer. In particular, we completely resolve the case when $S$ is the set of triangular numbers.
We prove that $n$-bit integers may be multiplied in $O(n \log n \, 4^{\log^* n})$ bit operations. This complexity bound had been achieved previously by several authors, assuming various unproved number-theoretic hypotheses. Our proof is unconditional, and depends in an essential way on Minkowski's theorem concerning lattice vectors in symmetric convex sets.
For a wide class of sequences of integer domains $\mathcal{D}_n\subset\mathbb{N}^d$, $n\in\mathbb{N}$, we prove distributional limit theorems for $F(X_1^{(n)},\ldots,X_d^{(n)})$, where $F$ is a multivariate multiplicative function and $(X_1^{(n)},\ldots,X_d^{(n)})$ is a random vector with uniform distribution on $\mathcal{D}_n$. As a corollary, we obtain limit theorems for the greatest common divisor and least common multiple of the random set $\{X_1^{(n)},\ldots,X_d^{(n)}\}$. This generalizes previously known limit results for $\mathcal{D}_n$ being either a discrete cube or a discrete hyperbo…
An algorithm which either finds an nonzero integer vector ${\mathbf m}$ for given $t$ real $n$-dimensional vectors ${\mathbf x}_1,...,{\mathbf x}_t$ such that ${\mathbf x}_i^T{\mathbf m}=0$ or proves that no such integer vector with norm less than a given bound exists is presented in this paper. The cost of the algorithm is at most ${\mathcal O}(n^4 + n^3 \log λ(X))$ exact arithmetic operations in dimension $n$ and the least Euclidean norm $λ(X)$ of such integer vectors. It matches the best complexity upper bound known for this problem. Experimental data show that the algorithm is better than …
The robust Chinese remainder theorem (CRT) has been recently proposed for robustly reconstructing a large nonnegative integer from erroneous remainders. It has found many applications in signal processing, including phase unwrapping and frequency estimation under sub-Nyquist sampling. Motivated by the applications in multidimensional (MD) signal processing, in this paper we propose the MD-CRT and robust MD-CRT for integer vectors. Specifically, by rephrasing the abstract CRT for rings in number-theoretic terms, we first derive the MD-CRT for integer vectors with respect to a general set of int…
In this paper we deduce a lower bound for the rank of a family of $p$ vectors in $\R^k$ (considered as a vector space over the rationals) from the existence of a sequence of linear forms on $\R^p$, with integer coefficients, which are small at $k$ points. This is a generalization to vectors of Nesterenko's linear independence criterion (which corresponds to $k=1$), used by Ball-Rivoal to prove that infinitely many values of Riemann zeta function at odd integers are irrational. The proof is based on geometry of numbers, namely Minkowski's theorem on convex bodies.
We show that there exist real numbers $α_1,α_2$ linearly independent over $\mathbb{Z}$ together with 1 such that for every non-zero integer vector $(m_1,m_2)$ with $m_1\ge 0$ and $m_2\ge 0$ one has $||m_1α_1+m_2α_2|| \ge 2^{-300} (\max(m_1, m_2))^{-σ}$ with $σ= 1.94696^+$.
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences, where the underlying prime congruence structures of the rational sequence denominators enables the integer sequence to be recovered. From either the rational or the integer sequences we construct sequences of vectors in $\mathbb{Q}^m$, which converge to irrational algebraic points in $\mathbb{R}^m$. The rational sequence terms can be expressed as simple recurren…
Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when considering equally-likely random permutations on the set of $n$ letters. For one of the distributions, the expectation vector and covariance matrix is derived. For the other distribution, conjectures for several elements of the expectation vector are provided.
The set of primitive vectors on large spheres in the euclidean space of dimension d>2 equidistribute when projected on the unit sphere. We consider here a refinement of this problem concerning the direction of the vector together with the shape of the lattice in its orthogonal complement. Using unipotent dynamics we obtained the desired equidistribution result in dimension d>5 and in dimension d=4,5 under a mild congruence condition on the square of the radius. The case of d=3 is considered in a separate paper.
We consider redundant binary joint digital expansions of integer vectors. The redundancy is used to minimize the Hamming weight, i.e., the number of nonzero digit vectors. This leads to efficient linear combination algorithms in abelian groups, which are for instance used in elliptic curve cryptography. If the digit set is a set of contiguous integers containing the zero, a special syntactical condition is known to minimize the weight. We analyze the optimal weight of all non-negative integer vectors with maximum entry less than N. The expectation and the variance are given with a main term an…
We build up a directed network tracing links from a given integer to its divisors and analyze the properties of the Google matrix of this network. The PageRank vector of this matrix is computed numerically and it is shown that its probability is inversely proportional to the PageRank index thus being similar to the Zipf law and the dependence established for the World Wide Web. The spectrum of the Google matrix of integers is characterized by a large gap and a relatively small number of nonzero eigenvalues. A simple semi-analytical expression for the PageRank of integers is derived that allows…
This is an account of the algebraic geometry of Witt vectors and arithmetic jet spaces. The usual, "p-typical" Witt vectors of p-adic schemes of finite type are already reasonably well understood. The main point here is to generalize this theory in two ways. We allow not just p-typical Witt vectors but those taken with respect to any set of primes in any ring of integers in any global field, for example. This includes the "big" Witt vectors. We also allow not just p-adic schemes of finite type but arbitrary algebraic spaces over the ring of integers in the global field. We give similar general…
