Related papers: Minimal Niven numbers
We study the minimal denominator problem in function fields. In particular, we compute the probability distribution function of the the random variable which returns the degree of the smallest denominator $Q$, for which the ball of a fixed…
A real random variable admits median(s) and quantiles. These values minimize convex functions on $\mathbb R$. We show by "Convex Analysis" arguments that the function to be minimized is very natural. The relationship with some notions about…
We analyze the representation of $A^{n}$ as a linear combination of $A^{j},\ 0\leq j\leq k-1,$ where $A$ is a $k\times k$ matrix. We obtain a first order asymptotic approximation of $A^{n}$ as $n\to\infty,$ without imposing any special…
Several mathematical problems can be modeled as a search in a database. An example is the problem of finding the minimum of a function. Quantum algorithms for solving this problem have been proposed and all of them use the quantum search…
The minimum status of a graph is the minimum of statuses of all vertices of this graph. We give a sharp upper bound for the minimum status of a connected graph with fixed order and matching number (domination number, respectively), and…
We consider the local properties problem for difference sets: we define $g(n, k, \ell)$ to be the minimum value of $\lvert A - A\rvert$ over all $n$-element sets $A \subseteq \mathbb{R}$ with the `local property' that $\lvert A' - A'\rvert…
The paper presents a lower bound for the number of negative eigenvalues of an integral operator with continuous kernel K lying below a nonpositive number t. The estimate is given in terms of some integrals of K.
We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by…
The quantum chromatic number, $\chi_q(G)$, of a graph $G$ was originally defined as the minimal number of colors necessary in a quantum protocol in which two provers that cannot communicate with each other but share an entangled state can…
In this paper we study the problem of counting Salem numbers of fixed degree. Given a set of disjoint intervals $I_1,\ldots, I_{k}\subset \left[0;\pi\right]$, $1\leq k\leq m$ let $Sal_{m,k}(Q,I_1,\ldots,I_{k})$ denote the set of ordered…
Let $k$ be an infinite field and $I\subset k [x_1, \ldots ,x_n]$ be an ideal such that dim $V(I)=q$. Denote by $(f_1, \ldots, f_s)$ a set of generators of $I$. One can see that in the set $I\cap k [x_{1},...,x_{q+1}]$ there exist non-zero…
We describe the results of the computation of aliquot sequences with small starting values. In particular all sequences with starting values less than a million have been computed until either termination occurred (at 1 or a cycle), or an…
In this short note we introduce the Belyi degree of a number field K, which is the smallest degree of a dessin d'enfant having K as field of moduli. After the description of some general properties (for example, the fact that there exist…
We establish a quantitative lower bound on the reach of flat norm minimizers for boundaries in $\mathbb{R}^2$.
We find a lower bound for the number of Chen primes in the arithmetic progression $a \bmod q$, where $(a,q)=(a+2,q)=1$. Our estimate is uniform for $q \leq \log^M x$, where $M>0$ is fixed.
Let $K_q(n,r)$ denote the minimum size of a $q$-ary covering code of word length $n$ and covering radius $r$. In other words, $K_q(n,r)$ is the minimum size of a set of $q$-ary codewords of length $n$ such that the Hamming balls of radius…
We outline some simple prescriptions to define a distribution on the set $\mathbb{Q}_0$ of all the rational numbers in $[0,1]$, and we then explore both a few properties of these distributions, and the possibility of making these rational…
A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $\pi_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument,…
For a general family of non-negative functions matching upper and lower bounds are established for their average over the values of any equidistributed sequence.
Let $\Omega$ be a bounded domain of $\mathbb{R}^{N}$, $p\in C^{1}(\overline{\Omega}),$ $q\in C(\overline{\Omega})$ and $l,j\in\mathbb{N}.$ We describe the asymptotic behavior of the minimizers of the Rayleigh quotient $\frac{\Vert\nabla…