English
Related papers

Related papers: Finitness Principles for Smooth Selection

200 papers

In [4], D'Angelo introduced the notion of points of finite type for a real hypersurface $M$ in $\mathbb C^n$ and showed that the set of points of finite type in $M$ is open. Later, Lamel-Mir [8] considered a natural extension of D'Angelo's…

Complex Variables · Mathematics 2020-02-28 Ozcan Yazici

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

Theoretical Economics · Economics 2021-11-17 Leandro Gorno , Alessandro Rivello

A novel selection principle was introduced by Dorantes-Aldama and Shakhmatov: a topological space $X$ is termed {\em selectively pseudocompact} if for any sequence $(U_n:n\in {\omega})$ of pairwise disjoint non-empty open sets of $X$, one…

General Topology · Mathematics 2025-10-21 István Juhász , Lajos Soukup , Zoltán Szentmiklóssy

A characterization of $n$-dimensional spaces via continuous selections avoiding $Z_n$-sets is given, and a selection theorem for strongly countable-dimensional spaces is established. We apply these results to prove a generalized Ostrand's…

General Topology · Mathematics 2007-05-23 V. Gutev , V. Valov

Assume that $X$ is a Banach space of measurable functions for which Koml\'os' Theorem holds. We associate to any closed convex bounded subset $C$ of $X$ a coefficient $t(C)$ which attains its minimum value when $C$ is closed for the…

Functional Analysis · Mathematics 2017-09-12 T. Domínguez Benavides , M. A , Japón

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

Logic · Mathematics 2024-10-30 Tamás Kátay , László Márton Tóth , Zoltán Vidnyánszky

Denoting by ${\mathcal L}_d(m_0,m_1,...,m_r)$ the linear system of plane curves passing through $r+1$ generic points $p_0,p_1,...,p_r$ of the projective plane with multiplicity $m_i$ (or larger) at each $p_i$, we prove the…

Algebraic Geometry · Mathematics 2007-05-23 F. Monserrat

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

The following natural question arises from Shalom's innovational work (1999, Publ. IHES): "Can we establish an intrinsic criterion to synthesize relative fixed point properties into the whole fixed point property without assuming Bounded…

Group Theory · Mathematics 2016-11-16 Masato Mimura

We consider selective classification with abstention in the fixed-pool (or transductive) setting, where the unlabeled pool is given beforehand and only a subset of points can be queried for labels. Our main insight is to view selective…

Machine Learning · Computer Science 2026-05-05 Mohamadsadegh Khosravani

We prove the following generalisation of Schauder's fixed point conjecture: Let $C_1,...,C_n$ be convex subsets of a Hausdorff topological vector space. Suppose that the $C_i$ are closed in $C=C_1\cup...\cup C_n$. If $f:C\to C$ is a…

Algebraic Topology · Mathematics 2012-01-13 Robert Cauty

Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…

Functional Analysis · Mathematics 2022-01-14 Adrian Fan , Jack Montemurro , Pavlos Motakis , Naina Praveen , Alyssa Rusonik , Paul Skoufranis , Noam Tobin

We provide a Reifenberg type characterization for $m$-dimensional $C^1$-submanifolds of $\mathbb R^n$. This characterization is also equivalent to Reifenberg-flatness with vanishing constant combined with suitably converging approximating…

Differential Geometry · Mathematics 2018-04-17 Bastian Käfer

Feder-Vardi conjecture, which proposed that every finite-domain Constraint Satisfaction Problem (CSP) is either in P or it is NP-complete, has been solved independently by Bulatov and Zhuk almost ten years ago. Bodirsky-Pinsker conjecture…

Computational Complexity · Computer Science 2026-04-06 Leonid Dorochko , Michał Wrona

We establish various forms of the following certainty principle: a set $S \subset \mathbb{R}^{n}$ contains a given finite linear pattern, provided that $S$ is a support of the Fourier transform of a sufficiently singular probability measure…

Classical Analysis and ODEs · Mathematics 2024-10-22 Rami Ayoush

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

Logic · Mathematics 2015-12-11 Andreas Blass , Mauro Di Nasso

In this paper we prove that the space $\cM(n,\rv,D,\Lambda):=\{(M^n,g) \text{ closed }: ~~\Ric\ge -(n-1),~\Vol(M)\ge \rv>0, \diam(M)\le D \text{ and } \int_{M}|\Rm|^{n/2}\le \Lambda\}$ has at most $C(n,\rv,D,\Lambda)$ many diffeomorphism…

Differential Geometry · Mathematics 2024-05-14 Wenshuai Jiang , Guofang Wei

The first goal of this paper is to prove a sharp condition to guarantee of having a positive proportion of all congruence classes of triangles in given sets in $\mathbb{F}_q^2$. More precisely, for $A, B, C\subset \mathbb{F}_q^2$, if…

Combinatorics · Mathematics 2023-08-16 Thang Pham

In this short note we consider very general bounded minimal homogeneous domains. Under certain natural additional conditions new sharp results on Bergman type analytic spaces in minimal bounded homogeneous domains are obtained. Domains we…

Complex Variables · Mathematics 2025-08-28 R. F. Shamoyan , N. M. Makhina

The purpose of this note is to prove the existence of a randomized mechanism, a social decision scheme (SDS), with desirable fairness, efficiency, and strategyproofness properties unmatched by all known SDSs. In particular, we disprove a…

Computer Science and Game Theory · Computer Science 2014-11-27 Florian Brandl
‹ Prev 1 4 5 6 7 8 10 Next ›