English
Related papers

Related papers: Selection principles and the minimal tower problem

200 papers

We consider "Thurston maps": branched self-coverings of the sphere with ultimately periodic critical points, and prove that the Thurston equivalence problem between them (continuous deformation of maps along with their critical orbits) is…

Group Theory · Mathematics 2018-06-15 Laurent Bartholdi , Dzmitry Dudko

In many covering settings, it is natural to consider the presence both of elements that we seek to include and of elements that we seek to avoid. This paper introduces a novel combinatorial problem formalizing this tradeoff: from a…

Data Structures and Algorithms · Computer Science 2025-12-01 Sophie Boileau , Andrew Hong , David Liben-Nowell , Alistair Pattison , Anna N. Rafferty , Charlie Roslansky

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

Combinatorics · Mathematics 2014-07-18 Giovanni Felici , Sokol Ndreca , Aldo Procacci , Benedetto Scoppola

Topological sorting is an important technique in numerous practical applications, such as information retrieval, recommender systems, optimization, etc. In this paper, we introduce a problem of generalized topological sorting with…

Optimization and Control · Mathematics 2022-01-21 Jean Ruppert , Marharyta Aleksandrova , Thomas Engel

We study the equivariant orbifold birational classification problem for families of toroidal compactifications of a group $G$ over a toroidal base, in the cases where $G$ is an algebraic torus or a semiabelian scheme. The classification is…

Algebraic Geometry · Mathematics 2026-05-06 Jeremy Feusi , Sam Molcho

Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the…

Data Structures and Algorithms · Computer Science 2008-02-14 Omid Amini , Fedor V. Fomin , Saket Saurabh

The tower number $\mathfrak t$ and the ultrafilter number $\mathfrak u$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of~$\omega$ and the almost inclusion relation…

Logic · Mathematics 2024-10-07 Steffen Lempp , Joseph S. Miller , Andre Nies , Mariya Soskova

In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…

Rings and Algebras · Mathematics 2009-12-07 Jose Capco

Tropical algebraic geometry offers new tools for elimination theory and implicitization. We determine the tropicalization of the image of a subvariety of an algebraic torus under any homomorphism from that torus to another torus.

Algebraic Geometry · Mathematics 2007-05-23 Bernd Sturmfels , Jenia Tevelev

We study three fundamental problems of Linear Algebra, lying in the heart of various Machine Learning applications, namely: 1)"Low-rank Column-based Matrix Approximation". We are given a matrix A and a target rank k. The goal is to select a…

Data Structures and Algorithms · Computer Science 2011-05-05 Christos Boutsidis

There are theories of coverings of $C^*$-algebras which can be included into a following list: coverings of commutative $C^*$-algebras, coverings of $C^*$-algebras of groupoids and foliations, coverings of noncommutative tori, the double…

Operator Algebras · Mathematics 2024-07-19 Petr Ivankov

Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here,…

Data Structures and Algorithms · Computer Science 2018-12-04 Tanmay Inamdar , Kasturi Varadarajan

Given a finite alphabet $A$, a quasi-metric $d$ over $A^*$, and a non-negative integer $k$, we introduce the relation $\tau_{d,k}\subseteq A^*\times A^*$ such that $(x,y)\in\tau_{d,k}$ holds whenever $d(x,y)\le k$. The error detection…

Discrete Mathematics · Computer Science 2023-09-06 Jean Néraud

Let (G,tau_G) be a topological group. We establish relationships between weakly almost periodic topologies on G coarser than tau_G, central idempotents in the weakly almost periodic compactification G^W, and certain ideals in the algebra of…

Functional Analysis · Mathematics 2018-06-25 Nico Spronk

Lindel\"of spaces are studied in any basic Topology course. However, there are other interesting covering properties with similar behaviour, such as almost Lindel\"of, weakly Lindel\"of, and quasi-Lindel\"of, that have been considered in…

General Topology · Mathematics 2012-12-13 Petra Staynova

We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman and Sikdar, J. Computer and System Sciences, 75(2):137--153, 2009) are…

Computational Complexity · Computer Science 2009-08-28 Gregory Gutin , Eun Jung Kim , Michael Lampis , Valia Mitsou

In this paper, we study a class of set cover problems that satisfy a special property which we call the {\em small neighborhood cover} property. This class encompasses several well-studied problems including vertex cover, interval cover,…

Data Structures and Algorithms · Computer Science 2013-12-30 Archita Agarwal , Venkatesan T. Chakaravarthy , Anamitra R. Choudhury , Sambuddha Roy , Yogish Sabharwal

In this paper, the core convex topology on a real vector space $X$, which is constructed just by $X$ operators, is investigated. This topology, denoted by $\tau_c$, is the strongest topology which makes $X$ into a locally convex space. It…

Optimization and Control · Mathematics 2017-04-25 Ashkan Mohammadi , Majid Soleimani-damaneh

In model selection problems for machine learning, the desire for a well-performing model with meaningful structure is typically expressed through a regularized optimization problem. In many scenarios, however, the meaningful structure is…

Optimization and Control · Mathematics 2022-11-09 Jonathan Bunton , Paulo Tabuada

This expository paper explores the interaction of group ordering with topological questions, especially in dimensions 2 and 3. Among the topics considered are surfaces, braid groups, 3-manifolds and their structures such as foliations and…

Algebraic Topology · Mathematics 2014-03-20 Dale Rolfsen