English
Related papers

Related papers: The Mouse Set Theorem Just Past Projective

200 papers

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

Optimization and Control · Mathematics 2024-01-25 Daniel Dörfler , Andreas Löhne

In this note we show that if $(u_n)_{n\geqslant 1}$ is a simple linearly recurrent sequence of integers whose minimal recurrence of order $k$ involves only positive coefficients that has positive initial terms, then $(Mu_{n^s})_{n\geqslant…

Number Theory · Mathematics 2024-03-22 Florian Luca , Tom Ward

In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…

Logic · Mathematics 2023-01-31 Peter Hertling , Philip Janicki

In this paper we consider nonmeasurablity with respect to sigma-ideals defined be trees. First classical example of such ideal is Marczewski ideal s_0. We will consider also ideal l_0 defined by Laver trees and m_0 defined by Miller trees.…

General Topology · Mathematics 2015-07-10 Robert Ralowski , Szymon Zeberski

We study the multi-objective minimum weight base problem, an abstraction of classical NP-hard combinatorial problems such as the multi-objective minimum spanning tree problem. We prove some important properties of the convex hull of the…

Artificial Intelligence · Computer Science 2023-06-07 Anh Viet Do , Aneta Neumann , Frank Neumann , Andrew M. Sutton

Motivated by results of J. R. Kline and R. L. Moore (1919) that a compact subset of the plane, homeomorphic to a subset of the reals, lies on the arc, we give a purely topological characterisation of compact sets of the reals. This allows…

General Topology · Mathematics 2023-12-21 Wojciech Bielas , Mateusz Kula , Szymon Plewik

We study a poset of compositions restricted by part size under a partial ordering introduced by Bj\"{o}rner and Stanley. We show that our composition poset $C_{d+1}$ is isomorphic to the poset of words $A_d^*$. This allows us to use…

Combinatorics · Mathematics 2012-04-23 Adam M. Goyt

This paper is devoted to a study of the relative version of a Mori dream space (MDS for short), which was first introduced by Andreatta and Wi\'{s}newski and will be called Mori dream morphism (MDM) in this paper. An MDM is defined to be an…

Algebraic Geometry · Mathematics 2022-05-27 Rikito Ohta

In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions $d$ that are powers of prime numbers, there exists a set of up to $d+1$ bases that form an MUB set.…

Even if a Multi-modal Multi-Objective Evolutionary Algorithm (MMOEA) is designed to find solutions well spread over all locally optimal approximation sets of a Multi-modal Multi-objective Optimization Problem (MMOP), there is a risk that…

Neural and Evolutionary Computing · Computer Science 2022-07-05 Renzo J. Scholman , Anton Bouter , Leah R. M. Dickhoff , Tanja Alderliesten , Peter A. N. Bosman

We study how a countable algebraic root set passes to a fractal connectedness locus. Let $D_n=\{-n+1,-n+2,\ldots,n-1\}$, and let $R_n$ be the set of roots of monic polynomials whose non-leading coefficients lie in $D_n$. We study…

Dynamical Systems · Mathematics 2026-03-10 Bernat Espigule , David Juher

Reinforcement learning with function approximation has recently achieved tremendous results in applications with large state spaces. This empirical success has motivated a growing body of theoretical work proposing necessary and sufficient…

Machine Learning · Computer Science 2022-07-05 Daniel Kane , Sihan Liu , Shachar Lovett , Gaurav Mahajan

Bandyapadhyay et al. introduced the generalized minimum-membership geometric set cover (GMMGSC) problem [SoCG, 2023], which is defined as follows. We are given two sets $P$ and $P'$ of points in $\mathbb{R}^{2}$, $n=\max(|P|, |P'|)$, and a…

Computational Geometry · Computer Science 2023-12-06 Sathish Govindarajan , Siddhartha Sarkar

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Combinatorics · Mathematics 2025-05-30 Rajko Nenadov , Lander Verlinde

We work in the realm of sets of reals. We prove that in the Miller model and in a model constructed by Goldstern-Judah-Shelah all universally meager sets have size at most $\omega_1$. Some relations between combinatorial covering properties…

Logic · Mathematics 2025-12-18 Valentin Haberl , Piotr Szewczak , Lyubomyr Zdomskyy

This paper is about the old Wahba problem in its more general form, which we call "simultaneous rotation and correspondence search". In this generalization we need to find a rotation that best aligns two partially overlapping $3$D point…

Computer Vision and Pattern Recognition · Computer Science 2022-03-30 Liangzu Peng , Manolis C. Tsakiris , René Vidal

We construct positional numeral systems that work natively over nonderived polyadic $\left( m,n\right) $-rings whose addition takes $m$ arguments and multiplication takes $n$. In such rings, the length of an admissible additive word and a…

Number Theory · Mathematics 2026-05-04 Steven Duplij

In \cite{ZW}, the notion of homogenous perfect set as a generalization of Cantor type sets is introduced. Their Hausdorff, lower box-counting, upper box-counting and packing dimensions are studied in \cite{ZW} and \cite{WW}. In this paper,…

Complex Variables · Mathematics 2014-01-14 Yingqing Xiao

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

Logic · Mathematics 2015-06-09 Ioannis Souldatos

We prove that the height of any algebraic computation tree for deciding membership in a semialgebraic set is bounded from below (up to a multiplicative constant) by the logarithm of m-th Betti number (with respect to singular homology) of…

Computational Complexity · Computer Science 2015-08-18 Nicolai Vorobjov , Andrei Gabrielov
‹ Prev 1 8 9 10 Next ›