Related papers: Multiplicative complements I
It was proved that whenever $\mathbb{N}$ is partitioned into finitely many cells, one cell must contain arbitrary length arithmetic and geometric progression nicely intertwined, so that one cell must be rich in the sense of containing…
We answer two questions of Kra, Moreira, Richter and Robertson regarding the existence of infinite sumsets of the form $B + C$ in dense and sparse sets of integers and the relation of sumsets to sets of recurrence. We then further…
Complementarity polytope is a geometric structure that exists in N2-1 dimensional space for an N dimensional Hilbert space. The existence of N + 1 mutually unbiased bases(MUBs) is possible, if such a polytope can be shown to be a subset of…
We study compressible types in the context of (local and global) NIP. By extending a result in machine learning theory (the existence of a bound on the recursive teaching dimension), we prove density of compressible types. Using this, we…
The note shows an easy way to improve E.H. Smith's packing density bound in $\mathbb{R}^3$ from $0.53835...$ to $0.54755...$ .
We consider the multiplicative structure of sets of the form AA+1, where where A is a large, finite set of real numbers. In particular, we show that the additively shifted product set, AA+1 must have a large part outside of any generalized…
We obtain divisibility conditions on the multiplicative orders of elements of the form $\zeta + \zeta^{-1}$ in a finite field by exploiting a link to the arithmetic of real quadratic fields.
We develop an approximation method for the differential entropy $h(\mathbf{X})$ of a $q$-component Gaussian mixture in $\mathbb{R}^n$. We provide two examples of approximations using our method denoted by…
We augment LP with a strong conditional operator, to yield a logic we call "strong LP," or LP=>. The resulting logic can speak of consistency in more discriminating ways, but introduces new possibilities for trivializing paradoxes.
We say that a set $S$ is additively decomposed into two sets $A$ and $B$, if $S = \{a+b : a\in A, \ b \in B\}$. Here we study additively decompositions of multiplicative subgroups of finite fields. In particular, we give some improvements…
We examine the condition that a complex Banach algebra $A$ have dense invertible group. We show that, for commutative algebras, this property is preserved by integral extensions. We also investigate the connections with an old problem in…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
The density of the hyperbolic metric on the complement of a rectangular lattice is investigated. The question is related to conformal mapping of symmetric circular quadrilaterals with all zero angles.
Best possible bounds are obtained for the concentration function of an additive arithmetic function on sequences of shifted primes.
Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…
For an (indefinite) scalar product $[x,y]_B = x^HBy$ for $B= \pm B^H \in Gl_n(\mathbb{C})$ on $\mathbb{C}^n \times \mathbb{C}^n$ we show that the set of diagonalizable matrices is dense in the set of all $B$-selfadjoint, $B$-skewadjoint,…
Special bases of orthogonal polynomials are defined, that are suited to expansions of density and potential perturbations under strict particle number conservation. Particle-hole expansions of the density response to an arbitrary…
For $A \subseteq \mathbb{N}$, the question of when $R(A) = \{a/a' : a, a' \in A\}$ is dense in the positive real numbers $\mathbb{R}_+$ has been examined by many authors over the years. In contrast, the $p$-adic setting is largely…
This is a contribution to the classification problem for dp-minimal expansions of $(\mathbb{Z},+)$. Let $S$ be a dense cyclic group order on $(\mathbb{Z},+)$. We use results on "dense pairs" to construct uncountably many dp-minimal…
We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.