相关论文: An application of kissing numbers in sum-product e…

We provide numerical procedures for possibly best evaluating the sum of positive series. Our procedures are based on the application of a generalized version of Kummer's test.

We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved…

The famous Hadwiger theorem classifies all rigid motion invariant continuous valuations on convex sets as linear conbinations of quermassintegrals. We prove much more general result. We classify continuous valuations which are invariant…

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

A complete family of functional Steiner formulas is established. As applications, an explicit representation of functional intrinsic volumes using special mixed Monge-Amp\`ere measures and a new version of the Hadwiger theorem on convex…

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

Higher-dimensional Dedekind sums are defined as a generalization of a recent 1-dimensional probability model of Dilcher and Girstmair to a d-dimensional cube. The analysis of the frequency distribution of marked lattice points leads to new…

We study the number and the length of systoles on complete finite area orientable hyperbolic surfaces. In particular, we prove upper bounds on the number of systoles that a surface can have (the so-called kissing number for hyperbolic…

Contact numbers are natural extensions of kissing numbers. In this paper we give estimates for the number of contacts in a totally separable packing of n unit balls in Euclidean d-space for all n>1 and d>1.

We estimate the sum of products or quotients of $L$-functions, where the sum is taken over all quadratic extensions of given genus over a fixed global function field. Our estimate for the sum of the quotient of two $L$-functions is…

Let $H_n$ be the minimal number of smaller homothetic copies of an $n$-dimensional convex body required to cover the whole body. Equivalently, $H_n$ can be defined via illumination of the boundary of a convex body by external light sources.…

This note deals with estimating the volume of the set of separable mixed quantum states when the dimension of the state space grows to infinity. This has been studied recently for qubits; here we consider larger particles and conclude that,…

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…

We revisit an ingenious argument of K. Ball to provide sharp estimates for the volume of sections of a convex body in John's position. Our technique combines the geometric Brascamp-Lieb inequality with a generalised Parseval-type identity.…

The concept of QCD sum rules is extended to bound states composed of particles with finite mass such as scalar quarks or strange quarks. It turns out that mass corrections become important in this context. The number of relevant corrections…

The tensor product of one code endowed with the Hamming metric and one endowed with the rank metric is analyzed. This gives a code which naturally inherits the sum-rank metric. Specializing to the product of a cyclic code and a skew-cyclic…

This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…

We consider the problem of deriving upper bounds on the parameters of sum-rank-metric codes, with focus on their dimension and block length. The sum-rank metric is a combination of the Hamming and the rank metric, and most of the available…

Sum-rank codes have wide applications in multishot network coding, distributed storage and the construction of space-time codes. Asymptotically good sequences of linearized algebraic geometry sum-rank codes, exceeding the…