Related papers: The Mouse Set Theorem Just Past Projective

Magic sets of observables are minimal structures that capture quantum state-independent advantage for systems of $n\ge 2$ qubits and are, therefore, fundamental tools for investigating the interface between classical and quantum physics. A…

We prove constructively that the maximum possible number of minimal connected dominating sets in a connected undirected graph of order $n$ is in $\Omega(1.489^n)$. This improves the previously known lower bound of $\Omega(1.4422^n)$ and…

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framework called metric forest completion (MFC), where the learned…

We consider a large family of problems in which an ordering (or, more precisely, a chain of subsets) of a finite set must be chosen to minimize some weighted sum of costs. This family includes variations of Min Sum Set Cover (MSSC), several…

The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and…

By the Galvin-Mycielski-Solovay theorem, a subset $X$ of the line has Borel's strong measure zero if and only if $M+X\neq\mathbb{R}$ for each meager set $M$. A set $X\subseteq\mathbb{R}$ is meager-additive if $M+X$ is meager for each meager…

Let $d_i(m)$ denote the coefficients of the Boros-Moll polynomials. Moll's minimum conjecture states that the sequence $\{i(i+1)(d_i^2(m)-d_{i-1}(m)d_{i+1}(m))\}_{1\leq i \leq m}$ attains its minimum with $i=m$. This conjecture is a…

In this work, we present an $\Omega\left(\min\{\log \Delta, \sqrt{\log n}\}\right)$ lower bound for Maximal Matching (MM) in $\Delta$-ary trees against randomized algorithms. By a folklore reduction, the same lower bound applies to Maximal…

Many approaches in the field of machine learning and data analysis rely on the assumption that the observed data lies on lower-dimensional manifolds. This assumption has been verified empirically for many real data sets. To make use of this…

Here are two of our main results: Theorem 1. Let X be a normal space with dim X=n and m\geq n+1. Then the space C*(X,R^m) of all bounded maps from X into R^m equipped with the uniform convergence topology contains a dense G_{\delta}-subset…

The Minimum Linear Arrangement problem (MLA) consists of finding a mapping $\pi$ from vertices of a graph to distinct integers that minimizes $\sum_{\{u,v\}\in E}|\pi(u) - \pi(v)|$. In that setting, vertices are often assumed to lie on a…

Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…

It is shown, from hypotheses in the region of $\omega^2$ Woodin cardinals, that there is a transitive model of KP + AD$_\mathbb{R}$ containing all reals.

Approximate lattices of Euclidean spaces, also known as Meyer sets, are aperiodic subsets with fascinating properties. In general, approximate lattices are defined as approximate subgroups of locally compact groups that are discrete and…

We consider the map X defined on the rational numbers given by x --> x * ceil(x), where ceil(x) denotes the smallest integer greater than or equal to x, and study the problem of finding, for each rational, the smallest number of iterations…

This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity. A classical…

In this work the generalized Collatz problem $qn+1$ ($q$ odd) is studied. As a natural generalization of the original $3n+1$ problem, it consists of a discrete dynamical system of an arithmetical kind. Using standard methods of number…

We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…

Hamkins and Kikuchi (2016 and 2017) show that in both set theory and class theory the definable subset ordering of the universe interprets a complete and decidable theory. If $\mathcal{M}$ is a model of set theory, then $\langle M,…