English
Related papers

Related papers: Mild parametrizations of power-subanalytic sets

200 papers

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

Logic in Computer Science · Computer Science 2010-08-04 Russell O'Connor

We study estimation and inference on causal parameters under finely stratified rerandomization designs, which use baseline covariates to match units into groups (e.g. matched pairs), then rerandomize within-group treatment assignments until…

Econometrics · Economics 2025-01-07 Max Cytrynbaum

We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…

Complex Variables · Mathematics 2024-11-07 Evgeny Sevost'yanov , Denys Romash , Nataliya Ilkevych

We provide an information-theoretic framework for studying the generalization properties of machine learning algorithms. Our framework ties together existing approaches, including uniform convergence bounds and recent methods for adaptive…

Machine Learning · Computer Science 2020-06-22 Thomas Steinke , Lydia Zakynthinou

The problem of characterizing normed ordered spaces which admit a representation in the algebraic, order and norm sense as a subspace of $C(X)$, the space of all continuous functions on a compact Hausdorff space is a classical problem that…

Functional Analysis · Mathematics 2026-03-30 Serdar Ay

A classification theorem is obtained for a class of unital simple separable amenable Z-stable C*-algebras which exhausts all possible values of the Elliott invariant for unital stably finite simple separable amenable Z-stable C*-algebras.…

Operator Algebras · Mathematics 2021-05-05 Guihua Gong , Huaxin Lin , Z. Niu

Planar central configurations can be seen as critical points of the reduced potential or solutions of a system of equations. By the homogeneity and invariance of the potential with respect to SO(2), it is possible to see that the…

Dynamical Systems · Mathematics 2007-05-23 Davide L. Ferrario

We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…

Logic · Mathematics 2026-02-27 Matthias Kunik

We show that not every family of generalized microscopic sets forms an ideal. Moreover, we prove that some of these families have some weaker additivity properties and some of them do not have even that.

General Topology · Mathematics 2017-09-26 Klaudiusz Czudek , Adam Kwela , Nikodem Mrożek , Wojciech Wołoszyn

We prove that, if \mu<\lfloor n/2\rfloor, then every rational plane curve of degree n and class \mu is a limit of parametrizations of the same degree and class \mu+1. This property was conjectured in D.Cox, T.Sederberg,F.Chen's paper: "The…

Algebraic Geometry · Mathematics 2007-05-23 Carlos D'Andrea

The MPE (Most Probable Explanation) query plays an important role in probabilistic inference. MPE solution algorithms for probabilistic relational models essentially adapt existing belief assessment method, replacing summation with…

Artificial Intelligence · Computer Science 2012-10-19 Udi Apsel , Ronen I. Brafman

In this paper, we introduce and develop the concept of conditional quantization for Borel probability measures on $\mathbb{R}^k,$ considering both constrained and unconstrained frameworks. For each setting, we define the associated…

Probability · Mathematics 2025-06-06 Megha Pandey , Mrinal Kanti Roychowdhury

We show that the number of parameters for CM-modules of prescribed rank is semi-continuous in families of CM rings of Krull dimension 1. This transfers a result of Knoerrer from the commutative to the not necessarily commutative case. For…

alg-geom · Mathematics 2008-02-03 Y. A. Drozd , G. -M. Greuel

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

Combinatorics · Mathematics 2025-10-17 C. Terry , J. Wolf

We show how multiplier ideals can be used to obtain uniform multiplicative bounds for certain families of ideals on a smooth complex algebraic variety. In particular we prove a quick but rather surprising result about symbolic powers of…

Algebraic Geometry · Mathematics 2009-10-31 Lawrence Ein , Robert Lazarsfeld , Karen E. Smith

The purpose of this article is to develop a general parametric estimation theory that allows the derivation of the limit distribution of estimators in non-regular models where the true parameter value may lie on the boundary of the…

Statistics Theory · Mathematics 2022-11-28 Junichiro Yoshida , Nakahiro Yoshida

Cram\'er type moderate deviation theorems quantify the accuracy of the relative error of the normal approximation and provide theoretical justifications for many commonly used methods in statistics. In this paper, we develop a new…

Probability · Mathematics 2016-06-07 Qi-Man Shao , Wen-Xin Zhou

The main goal of this paper is to investigate the minimal size of families of curves on surfaces with the following property: a family of simple closed curves $\Gamma$ on a surface realizes all types of pants decompositions if for any pants…

Geometric Topology · Mathematics 2023-02-16 Niloufar Fuladi , Arnaud de Mesmay , Hugo Parlier

Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…

Symbolic Computation · Computer Science 2009-11-13 Juan Gerardo Alcazar

A theorem of Ding, Oporowski, Oxley, and Vertigan implies that any sufficiently large twin-free graph contains a large matching, a co-matching, or a half-graph as a semi-induced subgraph. The sizes of these unavoidable patterns are measured…

Computational Complexity · Computer Science 2026-02-10 Jan Dreier , Nikolas Mählmann , Sebastian Siebertz