Related papers: $ S $-unit values of $ G_n + G_m $ in function fie…

We consider space functions $s(n)$ of finitely presented groups $G =< A\mid R> .$ (These functions have a natural geometric analog.) To define $s(n)$ we start with a word $w$ over $A$ of length at most $n$ equal to 1 in $G$ and use…

The main objective of this paper is to look from the unique point of view at some phenomena arising in different areas of probability theory and mathematical statistics. We will try to understand what is common between classical…

A sequence $s(n)$ of integers is MC-finite if for every $m \in \mathbb{N}^+$ the sequence $s^m(n) = s(n) \bmod{m}$ is ultimately periodic. We discuss various ways of proving and disproving MC-finiteness. Our examples are mostly taken from…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

The linear complexity of a periodic sequence over $GF(p^m)$ plays an important role in cryptography and communication [12]. In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal…

We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…

After giving an overview of the existing theory regarding the periods of sequences defined by linear recurrences over finite fields, we give explicit descriptions of the sets of periods that arise if one considers all sequences over…

We obtain a bound on the girth g of a quaternion unit gain graph in terms of the rank r of its adjacency matrix. In particular, we show that g <= r + 2 and characterize all quaternion unit gain graphs for which g = r+2. This extends…

In this article, we construct generalized harmonic univalent mappings and find its coefficients bounds. We present the counterexample to validate the coefficient conjecture proposed by Clunie and Sheil-Small for the class of functions…

Let $G$ be a nonempty bounded domain in a finite-dimensional Euclidean space. The main results are general estimates from below at points from $G$ for an arbitrary subharmonic function $u\not\equiv -\infty$ on the closure of the domain $G$…

Let $G$ be a finite cyclic group. Every sequence $S$ of length $l$ over $G$ can be written in the form $S=(x_1g)\cdot\ldots\cdot(x_lg)$ where $g\in G$ and $x_1, \ldots, x_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be…

A folklore conjecture asserts the existence of a constant $c_n > 0$ such that $\#\mathcal{F}_n(X) \sim c_n X$ as $X\to \infty$, where $\mathcal{F}_n(X)$ is the set of degree $n$ extensions $K/\mathbb{Q}$ with discriminant bounded by $X$.…

Hyperstructures are a natural extension of regular algebraic structures in which one of the operations, known as the hyperoperation, is multivalued; a hyperfield is such an extension on a field. M. Krasner (1962) proved that the quotient…

In this paper, we are interested in the limit theorem question for sums of indicator functions. We show that in every aperiodic dynamical system, for every increasing sequence $(a_n)_{n\in\N}\subset\R_+$ such that $a_n\nearrow\infty$ and…

In this note we provide a simple formula of general term of recurrent sequence.

We consider a Dirichlet series $\sum_{n=1}^{\infty}a_n^{-s}$, where $a_n$ satisfies a linear recurrence of arbitrary degree with integer coefficients. Under suitable hypotheses, we prove that it has a meromorphic continuation to the complex…

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

The paper is devoted to the piece-wise analytic case of Meijer's $G$ function $G^{m,n}_{p,p}$. While the problem of its analytic continuation was solved in principle by Meijer and Braaksma we show that in the ''balanced'' case $m+n=p$ the…

We examine hypergeometric functions in the finite field, p-adic and classical settings. In each setting, we prove a formula which splits the hypergeometric function into a sum of lower order functions whose arguments differ by roots of…

We introduce a new notion of complexity of functions and we show that it has the following properties: (i) it governs a PAC Bayes-like generalization bound, (ii) for neural networks it relates to natural notions of complexity of functions…