English
Related papers

Related papers: Scales and the fine structure of K(R). Part I: Acc…

200 papers

Proper scoring rules are methods for encouraging honest assessment of probability distributions. Just like likelihood, a proper scoring rule can be applied to supply an unbiased estimating equation for any statistical model, and the theory…

Statistics Theory · Mathematics 2020-04-28 Philip Dawid , Monica Musio , Laura Ventura

Let M be an o-minimal structure with elimination of imaginaries, N an unstable structure definable in M. Then there exists X, interpretable in N, such that X with all the structure induced from N is o-minimal. In particular X is linearly…

Logic · Mathematics 2007-05-23 Assaf Hasson , Alf Onshuus

We propose the segmentation of noisy datasets into Multiple Inlier Structures with a new Robust Estimator (MISRE). The scale of each individual structure is estimated adaptively from the input data and refined by mean shift, without tuning…

Computer Vision and Pattern Recognition · Computer Science 2017-09-28 Xiang Yang , Peter Meer

We study two-stage robust optimization problems with mixed discrete-continuous decisions in both stages. Despite their broad range of applications, these problems pose two fundamental challenges: (i) they constitute infinite-dimensional…

Optimization and Control · Mathematics 2018-07-31 Anirudh Subramanyam , Chrysanthos E. Gounaris , Wolfram Wiesemann

Let $K$ be a field, $V$ a finite dimensional $K$-vector space and $E$ the exterior algebra of $V$. We analyze iterated mapping cone over $E$. If $I$ is a monomial ideal of $E$ with linear quotients, we show that the mapping cone…

Commutative Algebra · Mathematics 2024-05-14 Marilena Crupi , Antonino Ficarra , Ernesto Lax

Let K be an Abstract Elementary Class. Under the asusmptions that K has a nicely behaved forking-like notion, regular types and existence of some prime models we establish a decomposition theorem for such classes. The decomposition implies…

Logic · Mathematics 2007-05-23 Rami Grossberg , Olivier Lessmann

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

Group Theory · Mathematics 2020-05-26 James East , Nik Ruskuc

We study a knot type through the ropelength-filtered spaces of its thick representatives. For a knot type $K$ and a scale parameter $\Lambda>0$, let $Y_\Lambda(K)=\mathcal{R}_{1,\Lambda}(K)$ be the space of representatives of $K$ with…

Geometric Topology · Mathematics 2026-05-14 Makoto Ozawa

Kernel methods provide a theoretically grounded framework for non-linear and non-parametric learning, with strong analytic foundations and statistical guarantees. Yet, their scalability has long been limited by prohibitive time and memory…

Machine Learning · Computer Science 2025-10-01 Maedeh Zarvandi , Michael Timothy , Theresa Wasserer , Debarghya Ghoshdastidar

We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…

Algebraic Geometry · Mathematics 2021-03-09 Niels Lubbes

Let $k$ be a field of characteristic zero, and $R=k[x_1, \ldots, x_d]$ with $d \geq 3$ be a polynomial ring in $d$ variables. Let $\m=(x_1, \ldots, x_d)$ be the homogeneous maximal ideal of $R$. Let $\mathcal{K}$ be the kernel of the…

Commutative Algebra · Mathematics 2018-09-25 Sudeshna Roy

Let $R$ be a discrete valuation ring of field of fractions $K$ and of residue field $k$ of characteristic $p > 0$. In an earlier work, we studied the question of extending torsors on $K$-curves into torsors over $R$-regular models of the…

Algebraic Geometry · Mathematics 2025-04-30 Sara Mehidi

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

Combinatorics · Mathematics 2009-05-20 Kari Ragnarsson , Bridget Eileen Tenner

A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…

Computational Complexity · Computer Science 2025-03-27 Abhibhav Garg , Rafael Oliveira , Nitin Saxena

In many physical, statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpose, Karl Pearson invented principal component analysis in…

Machine Learning · Computer Science 2011-05-10 A. N. Gorban , A. Y. Zinovyev

Modellers of complex biological or social systems are often faced with an invidious choice: to use simple models with few mechanisms that can be fully analysed, or to construct complicated models that include all the features which are…

Physics and Society · Physics 2016-09-28 Luis F. Lafuerza , Louise Dyson , Bruce Edmonds , Alan J. McKane

A rank one local system $\LL$ on a smooth complex algebraic variety $M$ is admissible roughly speaking if the dimension of the cohomology groups $H^m(M,\LL)$ can be computed directly from the cohomology algebra $H^*(M,\C)$. We say that a…

Algebraic Geometry · Mathematics 2008-02-22 Shaheen Nazir , Zahid Raza

Let M be a polynomially bounded, o-minimal structure with archimedean prime model, for example if M is a real closed field. Let C be a convex and unbounded subset of M. We determine the first order theory of the structure M expanded by the…

Logic · Mathematics 2007-05-23 Marcus Tressl

Exploring further the properties of ITRM-recognizable reals, we provide a detailed analysis of recognizable reals and their distribution in G\"odels constructible universe L. In particular, we show that, for unresetting infinite time…

Logic · Mathematics 2026-05-19 Merlin Carl

Online graph problems are considered in models where the irrevocability requirement is relaxed. Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing…

Data Structures and Algorithms · Computer Science 2017-05-01 Joan Boyar , Lene M. Favrholdt , Kim S. Larsen , Michal Kotrbčík