English
Related papers

Related papers: An asymptotic version of Dumnicki's algorithm for …

200 papers

Suppose D is an effective divisor on a smooth projective algebraic variety X. For each point x of X we associate a numberical invariant called the moving Seshadri constant of D at x which is a numerical measure of positivity of the divisor…

Algebraic Geometry · Mathematics 2007-05-23 Michael Nakamaye

We undertake a precise study of the asymptotic and non-asymptotic properties of stochastic approximation procedures with Polyak-Ruppert averaging for solving a linear system $\bar{A} \theta = \bar{b}$. When the matrix $\bar{A}$ is Hurwitz,…

Machine Learning · Statistics 2020-04-10 Wenlong Mou , Chris Junchi Li , Martin J. Wainwright , Peter L. Bartlett , Michael I. Jordan

With the objective of developing computational methods for stability analysis of switched systems, we consider the problem of finding the minimal lower bounds on average dwell-time that guarantee global asymptotic stability of the origin.…

Optimization and Control · Mathematics 2023-07-24 Sigurdur Hafstein , Aneel Tanwani

We give a method to estimate Seshadri constants on toric varieties at any point. By using the estimations and toric degenerations, we can obtain some new computations or estimations of Seshadri constants on non-toric varieties. In…

Algebraic Geometry · Mathematics 2013-02-01 Atsushi Ito

We present a new methodology for studying non-Hamiltonian nonlinear systems based on an information theoretic extension of a renormalization group technique using a modified maximum entropy principle. We obtain a rigorous dimensionally…

Computational Physics · Physics 2013-06-28 M. Schmuck , M. Pradas , S. Kalliadasis , G. A. Pavliotis

An averaging method for getting uniformly valid asymptotic approximations of the solution of hyperbolic systems of equations is presented. The averaged system of equations disintegrates into independent equations for non-resonance systems.…

Mathematical Physics · Physics 2007-05-23 A. Krylovas , R. Ciegis

We consider high-dimensional estimation problems where the number of parameters diverges with the sample size. General conditions are established for consistency, uniqueness, and asymptotic normality in both unpenalized and penalized…

Statistics Theory · Mathematics 2025-04-08 Jana Gauss , Thomas Nagler

We derive optimal asymptotic and non-asymptotic lower bounds on the Widom factors for weighted Chebyshev and orthogonal polynomials on compact subsets of the real line. In the Chebyshev case we extend the optimal non-asymptotic lower bound…

Classical Analysis and ODEs · Mathematics 2024-08-22 Gökalp Alpan , Maxim Zinchenko

We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannian spaces for the chordal distance. We obtain explicit bounds, and an asymptotic bound that improves on the Hamming bound. Our approach…

Combinatorics · Mathematics 2016-11-18 Christine Bachoc

Arrangements of pseudolines are classic objects in discrete and computational geometry. They have been studied with increasing intensity since their introduction almost 100 years ago. The study of the number $B_n$ of non-isomorphic simple…

Combinatorics · Mathematics 2024-03-22 Fernando Cortés Kühnast , Justin Dallant , Stefan Felsner , Manfred Scheucher

Asymptotic stationarity and regularity conditions turned out to be quite useful to study the qualitative properties of numerical solution methods for standard nonlinear and complementarity-constrained programs. In this paper, we first…

Optimization and Control · Mathematics 2021-09-02 Patrick Mehlitz

Given a nef and big line bundle $L$ on a projective variety $X$ of dimension $d \geq 2$, we prove that the Seshadri constant of $L$ at a very general point is larger than $(d+1)^{\frac{1}{d}-1}$. This slightly improves the lower bound $1/d$…

Algebraic Geometry · Mathematics 2022-03-15 François Ballaÿ

We present a polynomial-time algorithm that obtains a set of Asymptotic Linear Programs (ALPs) from a given linear system S, such that one of these ALPs admits a feasible solution if and only if S admits a feasible solution. We also show…

Computational Complexity · Computer Science 2012-06-20 Deepak Ponvel Chermakani

Two types of errors can occur when discriminating pairs of quantum states. Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other. We give explicit expressions bounding…

Quantum Physics · Physics 2023-11-23 Jason L. Pereira , Leonardo Banchi , Stefano Pirandola

We estimate the error term in the asymptotic formula of the Sidon constant for (ordinary) Dirichlet polynomials by providing explicit lower and upper bounds. The lower bound is already implicitly known, but we supply the necessary…

Number Theory · Mathematics 2014-06-24 Ole Fredrik Brevig

We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…

Discrete Mathematics · Computer Science 2026-04-28 Julian Müller

We derive the local and central limit theorems for the Stirling numbers of the second kind by elementary means, obtaining as corollaries effective asymptotic estimates for the Bell numbers and for the moments of the distribution. We also…

Combinatorics · Mathematics 2026-05-29 Hsien-Kuei Hwang , Chong-Yi Li , Vytas Zacharovas

We find sharp bounds for the norm inequality on a Pseudo-hermitian manifold, where the L^2 norm of all second derivatives of the function involving horizontal derivatives is controlled by the L^2 norm of the sub-Laplacian. Perturbation…

Analysis of PDEs · Mathematics 2007-05-23 Sagun Chanillo , Juan J. Manfredi

This paper is concerned with investigating the asymptotic behavior of the gradients of solutions to a class of elliptic systems with general boundary data, especially covering the Lam\'{e} systems, in a narrow region. The novelty of this…

Analysis of PDEs · Mathematics 2022-04-15 Zhiwen Zhao

The number of independent sets is equivalent to the partition function of the hard-core lattice gas model with nearest-neighbor exclusion and unit activity. We study the number of independent sets $m_{d,b}(n)$ on the generalized Sierpinski…

Statistical Mechanics · Physics 2013-12-12 Shu-Chiuan Chang , Lung-Chi Chen , Weigen Yan
‹ Prev 1 4 5 6 7 8 10 Next ›