English
Related papers

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

200 papers

We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…

Combinatorics · Mathematics 2019-02-12 Michael Drmota , Éric Fusy , Mihyun Kang , Veronika Kraus , Juanjo Rué

The Riccati equation method and an approach of the use of unknown factors is used to establish oscillation, suboscillation and nonoscillation criteria for linear systems of ordinary differential equations. A necessary condition for Lyapunov…

Classical Analysis and ODEs · Mathematics 2022-12-02 G. A. Grigorian

We consider a quite general problem concerning a linear free oscillation of a discrete mass-spring-damper system. This discrete sub-system is embedded into a one-dimensional continuum medium described by the linear telegraph equation. In a…

Classical Physics · Physics 2024-11-15 Serge N. Gavrilov , Ilya O. Poroshin , Ekaterina V. Shishkina , Yulia A. Mochalova

Seshadri constants on abelian surfaces are fully understood in the case of Picard number one. Little is known so far for simple abelian surfaces of higher Picard number. In this paper we investigate principally polarized abelian surfaces…

Algebraic Geometry · Mathematics 2025-04-09 Thomas Bauer , Maximilian Schmidt

In the paper we develop a new method of proving non-speciality of a linear system with base fat points in general position. Using this method we show that the Hirschowitz-Harbourne Conjecture holds for systems with base points of equal…

Algebraic Geometry · Mathematics 2007-05-23 Marcin Dumnicki

Many asymptotic formulas exist for unrestricted integer partitions as well as for distinct partitions of integers into a finite number of parts. Szekeres and Canfield have derived an asymptotic formula for the number of partitions that is…

Combinatorics · Mathematics 2018-08-01 Vivien Brunel

Let $D^-$ and $D^+$ be properly immersed closed locally convex subsets of a Riemannian manifold with pinched negative sectional curvature. Using mixing properties of the geodesic flow, we give an asymptotic formula as $t\to+\infty$ for the…

Differential Geometry · Mathematics 2016-02-03 Jouni Parkkonen , Frédéric Paulin

We prove some general asymptotic formula for the values of $L$-function of a sequence of constructible $\mathbb Q_l$-sheaves on curves over $\mathbb F_q$ with some good asymptotic properties. We also give the asymptotic formula for the…

Number Theory · Mathematics 2014-12-03 Kubrak Dmitry

We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…

Number Theory · Mathematics 2020-01-07 Jing-Jing Huang , Huixi Li

Current performance bounds for randomized iterative methods are often considered tight under per-iteration analyses, yet they are notoriously loose in practice. We derive asymptotic performance bounds that narrow this theory-practice gap,…

Numerical Analysis · Mathematics 2026-03-19 Alireza Entezari , Arunava Banerjee

New algorithms for computing of asymptotic expansions for stationary distributions of nonlinearly perturbed semi-Markov processes are presented. The algorithms are based on special techniques of sequential phase space reduction, which can…

Probability · Mathematics 2017-03-08 Dmitrii Silvestrov , Sergei Silvestrov

This work examines the limits of the principal spectrum point, $\lambda_p$, of a nonlocal dispersal cooperative system with respect to the dispersal rates. In particular, we provide precise information on the sign of $\lambda_p$ as one of…

Analysis of PDEs · Mathematics 2024-01-11 Maria A. Onyido , Rachidi B. Salako , Markjoe O. Uba , Cyril I. Udeani

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

Cryptography and Security · Computer Science 2015-04-07 Igor Semaev

We prove limit theorems for the greatest common divisor and the least common multiple of random integers. While the case of integers uniformly distributed on a hypercube with growing size is classical, we look at the uniform distribution on…

Number Theory · Mathematics 2022-09-27 Alexander Iksanov , Alexander Marynych , Kilian Raschel

Let $X$ be a complex nonsingular projective surface and let $L$ be an ample line bundle on $X$. We study multi-point Seshadri constants of $L$ at singular points of certain arrangements of curves on $X$. We pose some questions about such…

Algebraic Geometry · Mathematics 2024-07-19 Krishna Hanumanthu , Praveen Kumar Roy , Aditya Subramaniam

The purpose of this paper is to prove local upper and lower bounds for weak solutions of semilinear elliptic equations of the form $-\Delta u= c u^p$, with $0<p<p_s=(d+2)/(d-2)$, defined on bounded domains of $\RR^d$, $d\ge 3$, without…

Analysis of PDEs · Mathematics 2012-01-30 Matteo Bonforte , Gabriele Grillo , Juan Luis Vazquez

Piecewise-deterministic Markov processes (PDMPs) offer a powerful stochastic modeling framework that combines deterministic trajectories with random perturbations at random times. Estimating their local characteristics (particularly the…

Methodology · Statistics 2025-12-29 Romain Azaïs , Solune Denis

We consider the problem of tracking a target whose dynamics is modeled by a continuous It\=o semi-martingale. The aim is to minimize both deviation from the target and tracking efforts. We establish the existence of asymptotic lower bounds…

Probability · Mathematics 2015-10-16 Jiatu Cai , Mathieu Rosenbaum , Peter Tankov

In this paper we present a novel non-parametric method of simplifying piecewise linear curves and we apply this method as a statistical approximation of structure within sequential data in the plane. We consider the problem of minimizing…

Computational Geometry · Computer Science 2012-05-31 Stephane Durocher , Alexandre Leblanc , Jason Morrison , Matthew Skala

The asymptotic variance is an important criterion to evaluate the performance of Markov chains, especially for the central limit theorems. We give the variational formulas for the asymptotic variance of discrete-time (non-reversible) Markov…

Probability · Mathematics 2020-12-29 Lu-Jing Huang , Yong-Hua Mao
‹ Prev 1 3 4 5 6 7 10 Next ›