Related papers: Uniform parameterization of subanalytic sets and d…
We adopt the concept of the composite parameterization of the unitary group U(d) to the special unitary group SU(d). Furthermore, we also consider the Haar measure in terms of the introduced parameters. We show that the well-defined…
We prove a monomialization theorem for mappings in general classes of infinitely differentiable functions that are called quasianalytic. Examples include Denjoy-Carleman classes, the class of $\cC^\infty$ functions definable in a…
We study the topological complexity of sets defined using Khovanskii's Pfaffian functions, in terms of an appropriate notion of format for those sets. We consider semi- and sub-Pfaffian sets, but more generally any definable set in the…
By universal formulas we understand parameterized analytic expressions that have a fixed complexity, but nevertheless can approximate any continuous function on a compact set. There exist various examples of such formulas, including some in…
The article discusses criteria for univalence of analytic functions in the unit disc. Various families of analytic functions depending on real parameters are considered. A unified method for creating new sets of conditions ensuring…
A total set of states for which we have no resolution of the identity (a `pre-basis'), is considered in a finite dimensional Hilbert space. A dressing formalism renormalizes them into density matrices which resolve the identity, and makes…
We develop a renormalization theory of non-perturbative dissipative H\'enon-like maps with combinatorics of bounded type. The main novelty of our approach is the incorporation of Pesin theoretic ideas to the renormalization method, which…
We set up a generalization of ubiquitous one-parameter families in algebraic geometry and their use for stability theories ([GIT, HL, AHLH]) to families over toric varieties and their analytic analogues. The language allows us to…
We prove \emph{uniform solvability estimates} for certain families of elliptic problems posed in a bounded family of domains (for example, a sequence that converges to another domain). We provide uniform estimates both in weighted and in…
This paper settles recent conjectures concerning the $p$-adic Haar measure applied to a family of sets defined in terms of Diophantine approximation. This is done by determining the spectrum of measure values for each family and seeing that…
In this paper we initiate a new approach to studying approximations by rational points to points on smooth submanifolds of $\mathbb{R}^n$. Our main result is a convergence Khintchine type theorem for arbitrary nondegenerate submanifolds of…
Incorporating a non-Euclidean variable metric to first-order algorithms is known to bring enhancement. However, due to the lack of an optimal choice, such an enhancement appears significantly underestimated. In this work, we establish a…
We introduce a relaxation for homomorphism problems that combines semidefinite programming with linear Diophantine equations, and propose a framework for the analysis of its power based on the spectral theory of association schemes. We use…
In this paper, we develop the foundations of the theory of quasiregular mappings in general metric measure spaces. In particular, nine definitions of quasiregularity for a discrete open mapping with locally bounded multiplicity are proved…
In this paper we develop a general theory of metric Diophantine approximation for systems of linear forms. A new notion of `weak non-planarity' of manifolds and more generally measures on the space of $m\times n$ matrices over $\Bbb R$ is…
Recently, W. M. Schmidt and L. Summerer introduced a new theory which allowed them to recover the main known inequalities relating the usual exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and to discover new ones. They…
The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…
One introduces a class of projective parameterizations that resemble generalized de Jonqui\`eres maps. Any such parametrization defines a birational map $\mathfrak{F}$ of $\pp^n$ onto a hypersurface $V(F)\subset \pp^{n+1}$ with a strong…
We study the complexity of the parameterised counting constraint satisfaction problem: given a set of constraints over a set of variables and a positive integer $k$, how many ways are there to assign $k$ variables to 1 (and the others to 0)…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…