SearcharxivSearch

arXiv subjects

Robert F. Tichy

Publications and source records attributed to Robert F. Tichy.

At least 19 recordsLinked to original sources

Distribution properties of generalized polynomials

A generalized polynomial is a function defined by an iteration of the operations addition, multiplication and the floor function. Equidistribution results of sequences given by generalized polynomials have been established by Håland and later by Bergelson and Leibman from an ergodic theoretic point of view. In the present paper we show an asymptotic distribution result which can be applied to certain generalized polynomials. In the second part we prove equidistribution results for generalized polynomials along prime numbers, including bounds for the discrepancy.

math.NT

Large common values of generalized Ankeny-Brauer-Chowla recurrences

In this paper we count the number of common values shared by two linear recurrence sequences, whose characteristic polynomials are a generalized Ankeny-Brauer-Chowla polynomial and its reciprocal. More precisely, we show that these sequences have at most two sufficiently large common values. Our proof combines Baker's theory of linear forms in logarithms of algebraic numbers with techniques from function field theory and from Galois theory.

math.NT

On Finite Pseudorandom Binary Sequences: Generalized polynomials

In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but also the floor function. We estimate the well-distribution measure, looking at the ``randomness'' along arithmetic progressions.

math.NT

Decidability of multiplicative matrix equations and related Diophantine problems

Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for Diophantine problems in finitely generated domains as presented in the recent book of Evertse and Györy. The focus lies on explicit bounds for the size of the solutions in terms of heights as well as on bounds for the number of solutions. This approach also works for systems of symmetric matrices which do not form a semigroup. In the final section some related counting problems are investigated.

math.NT

On Finite Pseudorandom Binary Sequences: Functions from a Hardy field

We provide a construction of binary pseudorandom sequences based on Hardy fields $\mathcal{H}$ as considered by Boshernitzan. In particular we give upper bounds for the well distribution measure and the correlation measure defined by Mauduit and Sárközy. Finally we show that the correlation measure of order $s$ is small only if $s$ is small compared to the ``growth exponent'' of $\mathcal{H}$.

math.NT

A Local Limit Theorem for Integer Partitions into Small Powers

The investigation of partitions of integers plays an important role in combinatorics and number theory. Among the many variations, partitions into powers $0<α<1$ were of recent interest. In the present paper we want to extend our considerations of the length of a random partition by providing a local limit theorem.

math.CO

A Central Limit Theorem for Integer Partitions into Small Powers

The study of the well-known partition function $p(n)$ counting the number of solutions to $n = a_{1} + \dots + a_{\ell}$ with integers $1 \leq a_{1} \leq \dots \leq a_{\ell}$ has a long history in combinatorics. In this paper, we study a variant, namely partitions of integers into \begin{equation*} n=\lfloor a_1^α\rfloor + \cdots + \lfloor a_\ell^α\rfloor \end{equation*} with $1\leq a_1 < \cdots < a_\ell$ and some fixed $0 < α< 1$. In particular, we prove a central limit theorem for the number of summands in such partitions, using the saddle point method.

math.NT

On the Diophantine equation $U_n-b^m = c$

Let $(U_n)_{n\in \mathbb{N}}$ be a fixed linear recurrence sequence defined over the integers (with some technical restrictions). We prove that there exist effectively computable constants $B$ and $N_0$ such that for any $b,c\in \mathbb{Z}$ with $b> B$ the equation $U_n - b^m = c$ has at most two distinct solutions $(n,m)\in \mathbb{N}^2$ with $n\geq N_0$ and $m\geq 1$. Moreover, we apply our result to the special case of Tribonacci numbers given by $T_1= T_2=1$, $T_3=2$ and $T_{n}=T_{n-1}+T_{n-2}+T_{n-3}$ for $n\geq 4$. By means of the LLL-algorithm and continued fraction reduction we are able to prove $N_0=1.1\cdot 10^{37}$ and $B=e^{438}$. The corresponding reduction algorithm is implemented in Sage.

math.NT

Multidimensional van der Corput sets and small fractional parts of polynomials

We establish Diophantine inequalities for the fractional parts of generalized polynomials $f$, in particular for sequences $ν(n)=\lfloor n^c\rfloor+n^k$ with $c>1$ a non-integral real number and $k\in\mathbb{N}$, as well as for $ν(p)$ where $p$ runs through all prime numbers. This is related to classical work of Heilbronn and to recent results of Bergelson \textit{et al.}

math.NT

On sums of S-integers of bounded norm

We prove an asymptotic formula for the number of S-integers in a number field K that can be represented by a sum of n S-integers of bounded norm.

math.NT

Integral equations, quasi-Monte Carlo methods and risk modelling

We survey a QMC approach to integral equations and develop some new applications to risk modeling. In particular, a rigorous error bound derived from Koksma-Hlawka type inequalities is achieved for certain expectations related to the probability of ruin in Markovian models. The method is based on a new concept of isotropic discrepancy and its applications to numerical integration. The theoretical results are complemented by numerical examples and computations.

math.PR

Computable Absolutely Pisot Normal Numbers

We analyze the convergence order of an algorithm producing the digits of an absolutely normal number. Furthermore, we introduce a stronger concept of absolute normality by allowing Pisot numbers as bases, which leads to expansions with non-integer bases.

math.NT

On Weyl products and uniform distribution modulo one

In the present paper we study the asymptotic behavior of trigonometric products of the form $\prod_{k=1}^N 2 \sin(πx_k)$ for $N \to \infty$, where the numbers $ω=(x_k)_{k=1}^N$ are evenly distributed in the unit interval $[0,1]$. The main result are matching lower and upper bounds for such products in terms of the star-discrepancy of the underlying points $ω$, thereby improving earlier results obtained by Hlawka in 1969. Furthermore, we consider the special cases when the points $ω$ are the initial segment of a Kronecker or van der Corput sequence. The paper concludes with some probabilistic analogues.

math.NT

On functions of bounded variation

The recently introduced concept of $\mathcal{D}$-variation unifies previous concepts of variation of multivariate functions. In this paper, we give an affirmative answer to the open question from Pausinger \& Svane (J. Complexity, 2014) whether every function of bounded Hardy--Krause variation is Borel measurable and has bounded $\mathcal{D}$-variation. Moreover, we show that the space of functions of bounded $\mathcal{D}$-variation can be turned into a commutative Banach algebra.

math.CA

Linear recursive odometers and beta-expansions

The aim of this paper is to study the connection between different properties related to $β$-expansions. In particular, the relation between two conditions, both ensuring pure discrete spectrum of the odometer, is analysed. The first one is the so-called Hypothesis B for the $G$-odometers and the second one is denoted by (QM) and it has been introduced in the framework of tilings associated to Pisot $β$-numerations.

math.DS

Diophantine equations and the monodromy groups

We study Diophantine equations of type f(x)=g(y), where both f and g have at least two distinct critical points and equal critical values at at most two distinct critical points. Some classical families of polynomials (f_n)_n are such that f_n satisfies these assumptions for all n. Our results cover and generalize several results in the literature on the finiteness of integral solutions to such equations. In doing so, we analyse the properties of the monodromy groups of such polynomials. We show that if f has coefficients in a field K, at least two distinct critical points and all distinct critical values, and char(K) is not a divisor of the degree of f, then the monodromy group of f is a doubly transitive permutation group. This is the same as saying that (f(x)-f(y))/(x-y) is irreducible over K. In particular, f cannot be represented as a composition of lower degree polynomials. We further show that if f has at least two distinct critical points and equal critical values at at most two of them, and if f(x)=g(h(x)), where g and h have coefficients in K and g is of degree at least 2, then either the degree of h is less or equal than 2, or f is of special type. In the latter case, in particular, f has no three simple critical points, nor five distinct critical points.

math.NT

Measure density for set decompositions and uniform distribution

The aim of this paper is to extend the concept of measure density introduced by Buck for finite unions of arithmetic progressions, to arbitrary subsets of N defined by a given system of decompositions. This leads to a variety of new examples and to applications to uniform distribution theory.

math.CA