Related papers: Parametrizing the abstract Ellentuck theorem
We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the…
For the generalized oscillator, we prove a Rellich type theorem, or characterize the order of growth of eigenfunctions. The proofs are given by an extensive use of commutator arguments invented recently by Ito and Skibsted. These arguments…
We establish a general principle which states that regularizing an inverse problem with a convex function yields solutions which are convex combinations of a small number of atoms. These atoms are identified with the extreme points and…
We prove symplectic versions of Suslin's famous $n!$-theorem for algebras over quadratically closed perfect fields of characteristic $\neq 2$ and for algebras over finite fields of characteristic $\neq 2$.
In this article we show the crucial role of elliptic regularity theory for the development of efficient numerical methods for the solution of some variational problems. Here we focus to a class of elliptic multiobjective optimal control…
Valuation algebras abstract a large number of formalisms for automated reasoning and enable the definition of generic inference procedures. Many of these formalisms provide some notions of solutions. Typical examples are satisfying…
Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…
In this paper, we obtain sharp estimates for the number of lattice points under and near the dilation of a general parabola, the former generalizing an old result of Popov. We apply Vaaler's lemma and the Erd\H{o}s-Turan inequality to…
In this paper, we develop a general approach to proving global and local uniform limit theorems for the Horvitz-Thompson empirical process arising from complex sampling designs. Global theorems such as Glivenko-Cantelli and Donsker…
Symmetries in the Lagrangian formalism of arbitrary order are analysed with the help of the so-called Anderson-Duchamp-Krupka equations. For the case of second order equations and a scalar field we establish a polynomial structure in the…
In this paper we generalize correspondence theorems of Mikhalkin and Nishinou-Siebert providing a correspondence between algebraic and parameterized tropical curves. We also give a description of a canonical tropicalization procedure for…
This paper studies theoretically and empirically a method of turning machine-learning algorithms into probabilistic predictors that automatically enjoys a property of validity (perfect calibration) and is computationally efficient. The…
This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…
We extend the conformal gluing construction of Isenberg-Mazzeo-Pollack [18] by establishing an analogous gluing result for field theories obtained by minimally coupling Einstein's gravitational theory with matter fields. We treat classical…
The paper is devoted to discretization of integral norms of functions from a given finite dimensional subspace. Even though this problem is extremely important in applications, its systematic study has begun recently. In this paper we…
We develop a theory of parametrized geometric cobordism by introducing smooth Thom stacks. This requires identifying and constructing a smooth representative of the Thom functor acting on vector bundles equipped with extra geometric data,…
Mirsky proved that, for the existence of a complex matrix with given eigenvalues and diagonal entries, the obvious necessary condition is also sufficient. We generalize this theorem to matrices over any field and provide a short proof.…
The non-extensive canonical ensemble theory is reconsidered with the method of Lagrange multipliers by maximizing Tsallis entropy, with the constraint that the normalized term of Tsallis' $q-$average of physical quantities, the sum $\sum…
We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may…
We present a new and simple proof of a theorem due to Kaplansky which unifies theorems of Kolchin and Levitzki on triangularizability of semigroups of matrices. We also give two different extensions of the theorem. As a consequence, we…