Related papers: Substituting the typical compact sets into a power…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
This article determines the asymptotics of the expected Riesz s-energy of the zero set of a Gaussian random systems of polynomials of degree N as the degree N tends to infinity in all dimensions and codimensions. The asymptotics are proved…
It is well known that in $n$-dimensional Euclidean space ($n\geq 2$) the classes of (diametrically) complete sets and of bodies of constant width coincide. Due to this, they both form a proper subfamily of the class of reduced bodies. For…
In this article, we show that in a $Q$-doubling space $(X,d,\mu),$ $Q>1,$ that supports a $Q$-Poincar\'e inequality and satisfies a chain condition, sets of $Q$-capacity zero have generalized Hausdorff $h$-measure zero for…
Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…
We define two notions of discrete dimension based on the Minkowski and Hausdorff dimensions in the continuous setting. After proving some basic results illustrating these definitions, we apply this machinery to the study of connections…
V.F. Molchanov considered the Hilbert series for the space of invariant skew-symmetric tensors and dual tensors with polynomial coefficients under the action of a real reflection group, and speculated that it had a certain product formula…
The Shapley-Folkman theorem is a statement about the Minkowski sum of (non-convex) sets, expressing the closeness of the Minkowski sum to convexity in a quantitative manner. This paper establishes similar theorems for integrally convex…
Under what circumstances does the ``closeness" of two functions imply the ``closeness" of their respective sublevel sets? In this paper, we answer this question by showing that if a sequence of functions converges strictly from above/below…
The Riordan group, along with its constituent elements, Riordan arrays, has been a tool for combinatorial exploration since its inception in 1991. More recently, this group has made an appearance in the area of mathematical physics, where…
For systems of equations with an infinite set of roots, one can sometimes obtain Kushnirenko-Bernstein-Khovanskii type theorem if replace the number of roots by their asymptotic density. We consider systems of entire functions with…
The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…
For any two arithmetic functions $f,g$ let $\bullet$ be the commutative and associative arithmetic convolution $(f\bullet g)(k):=\sum_{m=0}^k \left( \begin{array}{c} k m \end{array} \right)f(m)g(k-m)$ and for any $n\in\mathbb{N},$…
We generalize the Boolean power construction to the setting of compact Hausdorff spaces. This is done by replacing Boolean algebras with de Vries algebras (complete Boolean algebras enriched with proximity) and Stone duality with de Vries…
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, ...). Composition is a more complex task. We isolate a large class of power series for which composition can be performed…
We prove that for $d\ge 2,\, k\ge 2$, if the Hausdorff dimension of a compact set $E\subset \mathbb{R}^d$ is greater than $\frac{d^2}{2d-1}$, then, for any given $r > 0$, there exist $(x^1, \dots, x^{k+1})\in E^{k+1}$, $(y^1, \dots,…
In earlier papers we changed the concept of the inner product to a more general one, to the so-called Minkowski product. This product changes on the tangent space hence we could investigate a more general structure than a Riemannian…
In pioneering works of Meyer and of McMullen in the early 1970s, the set of Minkowski summands of a polytope was shown to be a polyhedral cone called the type cone. Explicit computations of type cones are in general intractable.…
The well-known factorization theorem of Lozanovski{\u \i} may be written in the form $L^{1}\equiv E\odot E^{\prime}$, where $\odot $ means the pointwise product of Banach ideal spaces. A natural generalization of this problem would be the…
We establish the following max-plus analogue of Minkowski's theorem. Any point of a compact max-plus convex subset of $(R\cup\{-\infty\})^n$ can be written as the max-plus convex combination of at most $n+1$ of the extreme points of this…