Related papers: Achievement sets of conditionally convergent serie…

We give a transform of convergent trigonometric series into equivalent convergent series and sufficient conditions for the transformed series to converge faster than the original one.

We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…

We show that mixtures comprised of multicomponent systems typically are much more structurally complex than the sum of their parts; sometimes, infinitely more complex. We contrast this with the more familiar notion of statistical mixtures,…

We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…

Motivated by questions arising in the study of the spectral theory of models of aperiodic order, we investigate sums of functions of semibounded closed subsets of the real line. We show that under suitable thickness assumptions on the sets…

Can multiverse hypotheses ever receive empirical support? Critics argue that multiverse scenarios posit unobservable entities, face severe underdetermination, or fall outside the bounds of science. This chapter challenges that view by…

We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…

This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…

Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…

We study the nonlinear realization of supersymmetry in a dynamical/cosmological background in which derivative terms like kinetic terms are finite. Starting from linearly realized theories, we integrate out heavy modes without neglecting…

In this paper we introduce an enhanced notion of extremal systems for sets in locally convex topological vector spaces and obtain efficient conditions for set extremality in the convex case. Then we apply this machinery to deriving new…

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…

We define a general notion of "summability" of a set $I\subseteq\mathbb{C^{N}}$ and show that some trivial condition necessary for a set to be summable, is also sufficient. We deduce some intresting corollaries.

In the present paper, we study a set that can be treated as a generalised set of subsums for a geometric series. This object was discovered independently in various mathematical aspects. For instance, it is closely related to various…

In this paper we present some interesting results involving summation of series in particular trigonometric ones. We failed to locate these results in existing literature or in the web like MathWorld (http://mathworld.wolfram.com/) nor…

In many everyday categories (sets, spaces, modules, ...) objects can be both added and multiplied. The arithmetic of such objects is a challenge because there is usually no subtraction. We prove a family of cases of the following principle:…

We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

This work considers special types of interval linear systems - overdetermined systems. Simply said these systems have more equations than variables. The solution set of an interval linear system is a collection of all solutions of all…