English
Related papers

Related papers: UPC condition with parameter for subanalytic sets

200 papers

We introduce a new categorical and constructive foundation for analytic approximation based on a Contextual Choice Principle (CCP), which enforces locality and compatibility in the construction of mathematical objects. Central to our…

Functional Analysis · Mathematics 2025-07-22 Andreu Ballus Santacana

We study the universal scaling limit of random partitions obeying the Schur measure. Extending our previous analysis [arXiv:2012.06424], we obtain the higher-order Pearcey kernel describing the multi-critical behavior in the cusp scaling…

Mathematical Physics · Physics 2024-02-06 Taro Kimura , Ali Zahabi

In this paper, we investigate the polyhedral structure of two submodular sets with generalized upper bound (GUB) constraints, which arise as important substructures in various real-world applications. We derive a class of strong valid…

Optimization and Control · Mathematics 2026-01-27 Weikang Qian , Keyan Li , Wei-Kun Chen , Yu-Hong Dai

In response to a 1997 problem of M. Vidyasagar, we state a necessary and sufficient condition for distribution-free PAC learnability of a concept class $\mathscr C$ under the family of all non-atomic (diffuse) measures on the domain…

Machine Learning · Computer Science 2010-11-08 Vladimir Pestov

The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…

Computational Complexity · Computer Science 2025-02-05 Tomáš Nagy , Michael Pinsker , Michał Wrona

We find an explicit sequence of univariate polynomials of arbitrary degree with optimal condition number. This solves a problem posed by Michael Shub and Stephen Smale in 1993.

Complex Variables · Mathematics 2021-06-29 Carlos Beltrán , Ujué Etayo , Jordi Marzo , Joaquim Ortega-Cerdà

We consider the problem of probably approximately correct (PAC) ranking $n$ items by adaptively eliciting subset-wise preference feedback. At each round, the learner chooses a subset of $k$ items and observes stochastic feedback indicating…

Machine Learning · Computer Science 2019-03-06 Aadirupa Saha , Aditya Gopalan

A domain $S\subset{\mathbb{R}}^d$ is said to fulfill the Poincar\'{e} cone property if any point in the boundary of $S$ is the vertex of a (finite) cone which does not otherwise intersects the closure $\bar{S}$. For more than a century,…

Statistics Theory · Mathematics 2014-03-24 Alejandro Cholaquidis , Antonio Cuevas , Ricardo Fraiman

In the introduction of this paper we discuss a possible approach to the unitarizability problem for classical p-adic groups. In this paper we give some very limited support that such approach is not without chance. In a forthcoming paper we…

Representation Theory · Mathematics 2017-09-05 Marko Tadic

This chapter reviews the microeconometrics literature on partial identification, focusing on the developments of the last thirty years. The topics presented illustrate that the available data combined with credible maintained assumptions…

Econometrics · Economics 2020-04-27 Francesca Molinari

The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of…

Differential Geometry · Mathematics 2010-03-02 Minh Q. Truong

Some filter relative notions of size, $\left( \mathcal{F},\mathcal{G}\right) $-syndeticity and piecewise $\mathcal{F} $-syndeticity, were defined and applied with clarity and focus by Shuungula, Zelenyuk and Zelenyuk in their paper ``The…

General Topology · Mathematics 2024-08-20 Conner Griffin

The notion of slicely countably determined (SCD) sets was introduced in 2010 by A.~Avil\'{e}s, V.~Kadets, M.~Mart\'{i}n, J.~Mer\'{i} and V.~Shepelska. We solve in the negative some natural questions about preserving being SCD by the…

Functional Analysis · Mathematics 2017-10-26 Vladimir Kadets , Antonio Pérez , Dirk Werner

A natural question, which appeared as Problem 61 in Hart and van Mill's list of open problems on $\beta\omega$ (2024), asks whether every finite partial order is embeddable in the Rudin--Keisler order on (types of) ultrafilters over a…

General Topology · Mathematics 2025-11-25 Nikolai L. Poliakov , Denis I. Saveliev

The critical points of the total scalar curvature functional, restricted to closed $n$-dimensional manifolds with constant scalar curvature metrics and unit volume, are termed CPE metrics. In 1987, Arthur L. Besse conjectured that CPE…

Differential Geometry · Mathematics 2026-03-13 Benedito Leandro

Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied…

Data Structures and Algorithms · Computer Science 2022-08-05 Konrad K. Dabrowski , Peter Jonsson , Sebastian Ordyniak , George Osipov , Magnus Wahlström

The main result of this note is a parametrized version of the Borsuk-Ulam theorem. We show that for a continuous family of Borsuk-Ulam situations, parameterized by points of a compact manifold W, its solution set also depends continuously…

Algebraic Topology · Mathematics 2012-10-12 Thomas Schick , Robert Simon , Stanislav Spiez , Henryk Torunczyk

In this paper we prove two new abstract compactness criteria in normed spaces. To this end we first introduce the notion of an equinormed set using a suitable family of semi-norms on the given normed space satisfying some natural…

Functional Analysis · Mathematics 2023-06-23 Jacek Gulgowski , Piotr Kasprzak , Piotr Maćkowiak

The unit selection problem aims to identify a set of individuals who are most likely to exhibit a desired mode of behavior, for example, selecting individuals who would respond one way if encouraged and a different way if not encouraged.…

Artificial Intelligence · Computer Science 2021-09-17 Ang Li , Judea Pearl

We study the satisfiability of ordering constraint satisfaction problems (CSPs) above average. We prove the conjecture of Gutin, van Iersel, Mnich, and Yeo that the satisfiability above average of ordering CSPs of arity $k$ is…

Data Structures and Algorithms · Computer Science 2015-11-03 Konstantin Makarychev , Yury Makarychev , Yuan Zhou
‹ Prev 1 3 4 5 6 7 10 Next ›