相关论文: Computing Complex Dimension Faster and Determinist…

We study non-linear data-dimension reduction. We are motivated by the classical linear framework of Principal Component Analysis. In nonlinear case, we introduce instead a new kernel-Principal Component Analysis, manifold and feature space…

We obtain a full asymptotic expansion for orthogonal polynomials with respect to weighted area measure on a Jordan domain $\mathscr{D}$ with real-analytic boundary. The weight is fixed and assumed to be real-analytically smooth and strictly…

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

We describe complex conjugation on the primitive middle-dimensional algebraic de Rham cohomology of a smooth projective hypersurface defined over a number field that admits a real embedding. We use Griffiths' description of the cohomology…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…

In this paper, we define the complex dimension of any additive subgroup of R^{n}$which generalize the euclidien dimension given for the vector space. We give an explicit method to calculate this dimension.

We prove Fourier restriction estimates by means of the polynomial partitioning method for compact subsets of any sufficiently smooth hyperbolic hypersurface in threedimensional euclidean space. Our approach exploits in a crucial way the…

Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…

Let k be an imaginary quadratic number field (with class number 1). We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/k up to a bound X on the norm of the relative discriminant…

We detail an algorithm that -- for all but a $\frac{1}{\Omega(\log(dH))}$ fraction of $f\in\mathbb{Z}[x]$ with exactly $3$ monomial terms, degree $d$, and all coefficients in $\{-H,\ldots, H\}$ -- produces an approximate root (in the sense…

Let $M$ be a representation of an acyclic quiver $Q$ over an infinite field $k$. We establish a deterministic algorithm for computing the Harder-Narasimhan filtration of $M$. The algorithm is polynomial in the dimensions of $M$, the weights…

We prove a polynomial bound in the "true complexity" problem of Gowers and Wolf. The proof uses only repeated applications of the Cauchy--Schwarz inequality, answering negatively a question posed by Gowers and Wolf. To choose and reason…

There are several methods to treat ensembles of random matrices in symmetric spaces, circular matrices, chiral matrices and others. Orthogonal polynomials and the supersymmetry method are particular powerful techniques. Here, we present a…

We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for…

A consequence of the results of Bers and Griffiths on the uniformization of complex algebraic varieties is that the universal cover of a family of Riemann surfaces, with base and fibers of finite hyperbolic type, is a contractible…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

We establish the geometric ergodicity of the preconditioned Hamiltonian Monte Carlo (HMC) algorithm defined on an infinite-dimensional Hilbert space, as developed in [Beskos et al., Stochastic Process. Appl., 2011]. This algorithm can be…

It is of importance to develop statistical techniques to analyze high-dimensional data in the presence of both complex dependence and possible outliers in real-world applications such as imaging data analyses. We propose a new robust…

Kohn introduced in 1979 the algorithm of multipliers to study the subelliptc estimate of the $\bar\partial$-Neumann problem for a smooth weakly pseudoconvex domain in a complex Euclidean space which satisfies D'Angelo's finite type…