Related papers: Some Brouwerian Counterexamples Regarding Nominal …
The main purpose of this paper is to investigate some natural problems regarding the order structure of representable functionals on $^*$-algebras. We describe the extreme points of order intervals, and give a nontrivial sufficient…
We generalize the notion of essential closures which is used in formulating a geometric necessary condition for a set to be the support of a multivariate copula. Furthermore, in some special cases, we derive an explicit formula of the…
A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a…
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…
This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…
How small can a set be while containing many configurations? Following up on earlier work of Erd\H os and Kakutani \cite{MR0089886}, M\'ath\'e \cite{MR2822418} and Molter and Yavicoli \cite{Molter}, we address the question in two…
In this paper we show that for every $2\leq n\in \mathbb{N}$, the statement "there is an $n$-entangled set, but there are no $n+1$-entangled sets" is consistent. We also prove some theorems which improve our understanding of entangled sets…
The paper explores the differential inclusion of a special form. It is supposed that the support function of the set in the right-hand side of an inclusion may contain the sum of the maximum and the minimum of the finite number of…
We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic to low (or low$_2$ sets. Using work of Miller, we can see…
The paper explores the differential inclusion of a special form. It is supposed that the support function of the set in the right-hand side of an inclusion may contain the maximum of the finite number of continuously differentiable (in…
A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…
We give necessary conditions for when a subset of $\mathbb{T}^n$ can contain the support of some non-zero RP-measure. Among other things we show that the support of a positive RP-measure cannot be contained in reflections of inverse images…
In the first part of this paper we show that a set $E$ has locally finite $s$-perimeter if and only if it can be approximated in an appropriate sense by smooth open sets. In the second part we prove some elementary properties of local and…
Wedderburn's theorem on the structure of finite dimensional semisimple algebras is proved by using minimal prerequisites.
We present a constructive proof of Brouwer's fixed point theorem for uniformly continuous and sequentially locally non-constant functions based on the existence of approximate fixed points. And we will show that Brouwer's fixed point…
We construct a weakly compact convex subset of $\ell^2$ with nonempty interior that has an isolated maximal element, with respect to the lattice order $\ell _+^2$. Moreover, the maximal point cannot be supported by any strictly positive…
Nearly convex sets play important roles in convex analysis, optimization and theory of monotone operators. We give a systematic study of nearly convex sets, and construct examples of subdifferentials of lower semicontinuous convex functions…
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…
This paper introduces a new problem concerning additive properties of convex sets. Let $S= \{s_1 < \dots <s_n \}$ be a set of real numbers and let $D_i(S)= \{s_x-s_y: 1 \leq x-y \leq i\}$. We expect that $D_i(S)$ is large, with respect to…
We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…