Related papers: On the size of a linear combination of two linear …

We contribute to a better understanding of the class of functions that can be represented by a neural network with ReLU activations and a given architecture. Using techniques from mixed-integer optimization, polyhedral theory, and tropical…

Let $S_n$ be the symmetric group of $n$ letters; Landau considered the function $g(n)$ defined as the maximal order of an element of $S_n$. This function is non-decreasing. Let us define the sequence $n_1=1, n_2=2, n_3=3, n_4=4,n_5=5,n_6=7,…

In [K. Bou-Rabee, B. Seward, J. Reine Angwe. Math. 2016] Bou-Rabee and Seward constructed examples of finitely generated residually finite groups $G$ whose residual finiteness growth function $\mathcal{F}_G$ can be at least as fast as any…

Let $f\colon X\to Y$ be a perfect surjective map of metrizable spaces. It is shown that if $Y$ is a $C$-space (resp., $\dim Y\leq n$ and $\dim f\leq m$), then the function space $C(X,\uin^{\infty})$ (resp., $C(X,\uin^{2n+1+m})$) equipped…

Let $F$ be the set of functions from an infinite set, $S$, to an ordered ring, $R$. For $f$, $g$, and $h$ in $F$, the assertion $f = g + O(h)$ means that for some constant $C$, $|f(x) - g(x)| \leq C |h(x)|$ for every $x$ in $S$. Let $L$ be…

We develop a theory of real numbers as rational Cauchy sequences, in which any two of them, $(a_n)$ and $(b_n)$, are equal iff $\lim\,(a_n-b_n)=0$. We need such reals in the Countable Mathematical Analysis ([4]) which allows to use only…

We study the properties of rectangular constant $ \mu(\mathbb{X}) $ in a normed linear space $\mathbb{X}$. We prove that $ \mu(\mathbb{X}) = 3$ iff the unit sphere contains a straight line segment of length 2. In fact, we prove that the…

We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…

A family of permutations A \subset S_n is said to be intersecting if any two permutations in A agree at some point, i.e. for any \sigma, \pi \in A, there is some i such that \sigma(i)=\pi(i). Deza and Frankl showed that for such a family,…

We introduce new sufficient conditions for permutation and monomial equivalence of linear cyclic codes over various finite fields. We recall that monomial equivalence and isometric equivalence are the same relation for linear codes over…

Motivated by the classical Hilbert's Sixteenth Problem, we extend some main developments obtained for Hilbert's number in the polynomial setting to the piecewise polynomial context. Specifically, we study the growth of the maximum number of…

The aim of this paper is to study the product of $n$ linear forms over function fields. We calculate the maximum value of the minima of the forms with determinant one when $n$ is small. The value is equal to the natural bound given by…

For a nilmanifold $G/\Gamma$, a $1$-Lipschitz continuous function $F$ and the M\"obius sequence $\mu(n)$, we prove a bound on the decay of the averaged short interval correlation $$\frac1{HN}\sum_{n\leq N}\Big|\sum_{h\leq H}…

Let $E_C$ be the hypergeometric system of differential equations satisfied by Lauricella's hypergeometric series $F_C$ of $m$ variables. We show that the monodromy representation of $E_C$ is irreducible under our assumption consisting of…

Let $ (H_s(n))_{n \geq 1} $ be an $s-$dimensional generalized Halton's sequence. Let $\emph{D}^{*}_N$ be the discrepancy of the sequence $ (H_s(n) )_{n = 1}^{N} $. It is known that $D^{*}_{N} =O(\ln^s N)$ as $N \to \infty $. In this paper,…

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…

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. Let $\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$…

We establish new recurrence and multiple recurrence results for a rather large family $\mathcal{F}$ of non-polynomial functions which includes tempered functions defined in [11], as well as functions from a Hardy field with the property…

Let $R$ be a gcd-domain (for example let $R$ be a unique factorization domain), and let $(a_n)_{n\geqslant1}$ be a sequence of nonzero elements in $R$. We prove that $\gcd(a_n,a_m)=a_{\gcd(n,m)}$ for all $n,m\geqslant1$ if and only if…

Fixing a subgroup $\Gamma$ in a group $G$, the full commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ of $G$ with $[\Gamma: \Gamma \cap \Delta][\Delta : \Gamma \cap \Delta] \leq n$. For…