Related papers: On multiplicative properties of combinatorial cube…
We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given $E\subset \mathbb…
It is known that commutators of commutators can be written as products of cubes, with the current upper bound on the number of cubes being 60. We discuss how proofs extracted via coset enumeration can be used to investigate this problem,…
We utilize ideal bipyramids to obtain new upper bounds on volume for hyperbolic link complements in terms of the combinatorics of their projections.
This work focuses on the combinatorial properties of glued semigroups and provides its combinatorial characterization. Some classical results for affine glued semigroups are generalized and some methods to obtain glued semigroups are…
Tensor products of ultrafilters have special combinatorial features closely related to Ramsey's Theorem, making them useful tools in applications. Here we first review their fundamental properties and isolate some new ones, including a…
We improve some upper bounds for minimal dispersion on the cube and torus. /Our new ingredient is an improvement of a probabilistic lemma used to obtain upper bounds for dispersion in several previous works. Our new lemma combines a random…
We prove new quantitative bounds on the additive structure of sets obeying an $L^3$ 'control' assumption, which arises naturally in several questions within additive combinatorics. This has a number of applications - in particular we…
Contraction coefficients give a quantitative strengthening of the data processing inequality. As such, they have many natural applications whenever closer analysis of information processing is required. However, it is often challenging to…
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
We prove bounds in the local $ L^2 $ range for exotic paraproducts motivated by bilinear multipliers associated with convex sets. One result assumes an exponential boundary curve. Another one assumes a higher order lacunarity condition.
We derive measurable lower bounds on concurrence of arbitrary mixed states, for both bipartite and multipartite cases. First, we construct measurable lower bonds on the purely algebraic bounds of concurrence [F. Mintert et al. (2004), Phys.…
We introduce two new binary operations with combinatorial species; the arithmetic product and the modified arithmetic product. The arithmetic product gives combinatorial meaning to the product of Dirichlet series and to the Lambert series…
We establish upper and lower universal bounds for potentials of weighted designs on the sphere $\mathbb{S}^{n-1}$ that depend only on quadrature nodes and weights derived from the design structure. Our bounds hold for a large class of…
In this paper, we derive certain congruences for the number of $3$-core cubic bipartitions using elementary $q$-series manipulations and dissection formulas.
The causal set theory d'Alembertian has rational coefficients for which alternating expressions are known. Here, a combinatorial interpretation of these numbers is given.
We derive a lower bound on the size of finite non-cyclic quotients of the braid group that is superexponential in the number of strands. We also derive a similar lower bound for nontrivial finite quotients of the commutator subgroup of the…
We obtain transformation formulas for quadratic character sums with quartic and cubic polynomial arguments.
We give a new proof of Dunn's additivity for the little $n$-cubes operads $C_n$, which has the advantage of being considerably shorter than the ones in the literature. At the end we remark on how our proof can be adjusted to work for the…
We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…
We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…