Related papers: The Mouse Set Theorem Just Past Projective

We prove that every primary basic semialgebraic set is homotopy equivalent to the set of inscribed realizations (up to M\"obius transformation) of a polytope. If the semialgebraic set is moreover open, then, in addition, we prove that (up…

In metric search, worst-case analysis is of little value, as the search invariably degenerates to a linear scan for ill-behaved data. Consequently, much effort has been expended on more nuanced descriptions of what performance might in fact…

A generating set for a finite group $G$ is said to be minimal if no proper subset generates $G$, and $m(G)$ denotes the maximal size of a minimal generating set for $G$. We prove a conjecture of Lucchini, Moscatiello and Spiga by showing…

Let $\mathcal{D}=(d_n)_{n=1}^\infty$ be a bounded sequence of integers with $d_n\ge 2$ and let $(i, j)$ be a pair of strictly positive numbers with $i+j=1$. We prove that the set of $x \in \RR$ for which there exists some constant $c(x) >…

The global simple evolutionary multi-objective optimizer (GSEMO) is a simple, yet often effective multi-objective evolutionary algorithm (MOEA). By only maintaining non-dominated solutions, it has a variable population size that…

A connected dominating set is a widely adopted model for the virtual backbone of a wireless sensor network. In this paper, we design an evolutionary algorithm for the minimum connected dominating set problem (MinCDS), whose performance is…

In this paper, we consider a closed Riemannian manifold $M^{n+1}$ with dimension $3\leq n+1\leq 7$, and a compact Lie group $G$ acting as isometries on $M$ with cohomogeneity at least $3$. After adapting the Almgren-Pitts min-max theory to…

Research involving computing with mobile agents is a fast-growing field, given the advancement of technology in automated systems, e.g., robots, drones, self-driving cars, etc. Therefore, it is pressing to focus on solving classical network…

We prove a variety of results concerning singular sets of reals. Our results concern: Kysiak and Laver-null sets, Kocinac and gamma-k-sets, Fleissner and square Q-sets, Alikhani-Koopaei and minimal Q-like-sets, Rubin and sigma-sets, and…

We propose new structures called almost o-minimal structures and $\mathfrak X$-structures. The former is a first-order expansion of a dense linear order without endpoints such that the intersection of a definable set with a bounded open…

Assuming $M_1$, the canonical inner model with one Woodin cardinal exists, we construct a model in which the nonstationary ideal on $\omega_1$ is $\aleph_2$-saturated, $\Delta_1$-definable with $\omega_1$ as the only parameter and there is…

This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…

Dyadic rationals are rationals whose denominator is a power of $2$. We define dyadic $n$-dimensional convex sets as the intersections with $n$-dimensional dyadic space of an $n$-dimensional real convex set. Such a dyadic convex set is said…

For a graph formed by vertices and weighted edges, a generalized minimum dominating set (MDS) is a vertex set of smallest cardinality such that the summed weight of edges from each outside vertex to vertices in this set is equal to or…

By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…

We show that for a minimal system $(X,T)$, the set of saturated points along cubes with respect to its maximal $\infty$-step pro-nilfactor $X_\infty$ has a full measure. As an application, it is shown that if a minimal system $(X,T)$ has no…

The study of inner models was initiated by G\"odel's analysis of the constructible universe. Later, the study of canonical inner models with large cardinals, e.g., measurable cardinals, strong cardinals or Woodin cardinals, was pioneered by…

The queen's graph $Q_{m \times n}$ has the squares of the $m \times n$ chessboard as its vertices; two squares are adjacent if they are in the same row, column, or diagonal of the board. A set $D$ of squares of $Q_{m \times n}$ is a…

Let $f$ be an $R$-closed homeomorphism on a connected orientable closed surface $M$. In this paper, we show that If $M$ has genus more than one, then each minimal set is either a periodic orbit or an extension of a Cantor set. If $M =…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…