Related papers: On univoque Pisot numbers
We consider several problems about pseudoprimes. First, we look at the issue of their distribution in residue classes. There is a literature on this topic in the case that the residue class is coprime to the modulus. Here we provide some…
Improving a result of N. Levinson, we exhibit large and small values of $|\zeta(1+it)|$.
We improve our earlier upper bound on the numbers of antipodal pairs of points among $n$ points in ${\mathbb{R}}^3$, to $2n^2/5+O(n^c)$, for some $c<2$. We prove that the minimal number of antipodal pairs among $n$ points in convex position…
The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of order N contains the cube graph Q_n or an independent set of…
We show that every 1-planar graph with minimum degree at least 4 has girth at most $8$, and every 1-planar graph with minimum degree at least 3 has girth at most $198$.
By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…
It is well-known that the triangulations of the disc with $n+2$ vertices on its boundary are counted by the $n$th Catalan number $C(n)=\frac{1}{n+1}{2n \choose n}$. This paper deals with the generalisation of this problem to any arbitrary…
Erd\H{o}s and Graham proposed to determine the number of subsets $S \subseteq \left\{1,2,\dots,n\right\}$ with $\sum_{s \in S} 1/s = 1$ and asked, among other things, whether that number could be as large as $2^{n - o(n)}$. We show that the…
We prove that for a finite set of points $X$ in the projective $n$-space over any field, the Betti number $\beta_{n,n+1}$ of the coordinate ring of $X$ is non-zero if and only if $X$ lies on the union of two planes whose sum of dimension is…
Kochen-Specker (KS) sets are fundamental in physics. Every time nature produces bipartite correlations attaining the nonsignaling limit, or two parties always win a nonlocal game impossible to always win classically, is because the parties…
We prove the endpoint case of a conjecture of Khot and Moshkovitz related to the Unique Games Conjecture, less a small error. Let $n\geq2$. Suppose a subset $\Omega$ of $n$-dimensional Euclidean space $\mathbb{R}^{n}$ satisfies…
We determine the range of the des statistic on every conjugacy class in the symmetric group $S_n$, prove that the minimum is $1$ (except for the identity class), and show that every intermediate value from $1$ to the maximum value is…
It is known that the longest simple path in the divisor graph that uses integers $\leq N$ is of length $\asymp N/\log N$. We study the partitions of $\{1,2,\dots, N\}$ into a minimal number of paths of the divisor graph, and we show that in…
Lazarev, Miller and O'Bryant investigated the distribution of $|S+S|$ for $S$ chosen uniformly at random from $\{0, 1, \dots, n-1\}$, and proved the existence of a divot at missing 7 sums (the probability of missing exactly 7 sums is less…
For natural numbers $n$ and $k$ ($n > 2k$), a generalized Petersen graph $P(n,k)$, is defined by vertex set $\lbrace u_i,v_i\rbrace$ and edge set $\lbrace u_iu_{i+1},u_iv_i,v_iv_{i+k}\rbrace$; where $i = 1,2,\dots,n$ and subscripts are…
An approach is given for estimating the Hausdorff dimension of the univoque set of a self-similar set. This sometimes allows us to get the exact Hausdorff dimensions of the univoque sets.
We classify the simple restricted modules for the minimal $p$-envelope of the non-graded, non-restricted Hamiltonian Lie algebra $H(2; (1,1); \Phi(1))$ over an algebraically closed field $k$ of characteristic $p \geq 5$. We also give the…
For any set $S$ of positive integers, a mixed hypergraph ${\cal H}$ is a realization of $S$ if its feasible set is $S$, furthermore, ${\cal H}$ is a one-realization of $S$ if it is a realization of $S$ and each entry of its chromatic…
The threshold degree of a function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p with f(x)=sgn p(x). We prove that the intersection of two halfspaces on {0,1}^n has threshold degree Omega(n), which matches the trivial upper…
We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…