English
Related papers

Related papers: Fractional Integration and Optimal Estimates for E…

200 papers

We deal with the distributions of holomorphic curves and integral points off divisors. We will simultaneouly prove an optimal dimension estimate from above of a subvariety W off a divisor D which contains a Zariski dense entire holomorphic…

Complex Variables · Mathematics 2007-05-23 Junjiro Noguchi , Joerg Winkelmann

If an elliptic differential operator associated with an $\mathbf{H}(\mathrm{curl})$-problem involves rough (rapidly varying) coefficients, then solutions to the corresponding $\mathbf{H}(\mathrm{curl})$-problem admit typically very low…

Numerical Analysis · Mathematics 2017-06-12 Dietmar Gallistl , Patrick Henning , Barbara Verfürth

We prove in this paper the global Lorentz estimate in term of fractional-maximal function for gradient of weak solutions to a class of p-Laplace elliptic equations containing a non-negative Schr\"odinger potential which belongs to reverse…

Analysis of PDEs · Mathematics 2020-09-29 Minh-Phuong Tran , Thanh-Nhan Nguyen , Gia-Bao Nguyen

In this paper, we are concerned with stable solutions to the fractional elliptic equation $$ (-\Delta)^s u=e^u\mbox{ in }\mathbb R^{N}, $$ where $(-\Delta)^s$ is the fractional Laplacian with $0<s<1$. We establish the nonexistence of stable…

Analysis of PDEs · Mathematics 2019-11-15 Anh Tuan Duong , Van Hoang Nguyen

Under the Riemann Hypothesis for Dirichlet L-functions, we improve on the error term in a smoothed version of an estimate for the density of elliptic curves with square-free $\Delta=D/16$, where D is the discriminant, by T.D. Browning and…

Number Theory · Mathematics 2015-06-10 Stephan Baier

We provide a unified analysis of a posteriori and a priori error bounds for a broad class of discontinuous Galerkin and $C^0$-IP finite element approximations of fully nonlinear second-order elliptic Hamilton--Jacobi--Bellman and Isaacs…

Numerical Analysis · Mathematics 2021-03-24 Ellya L. Kawecki , Iain Smears

We consider elliptic equations of the form (E) $-Au=f(x,u)+\mu$, where $A$ is a negative definite self-adjoint Dirichlet operator, $f$ is a function which is continuous and nonincreasing with respect to $u$ and $\mu$ is a Borel measure of…

Analysis of PDEs · Mathematics 2016-12-22 Tomasz Klimsiak

Hardy-Littlewood-Sobolev (HLS) Inequality fails in the "critical" case: \mu=n. However, for discrete HLS, we can derive a finite form of HLS inequality with logarithm correction for a critical case: \mu=n and p=q, by limiting the inequality…

Analysis of PDEs · Mathematics 2013-06-10 Ze Cheng , Congming Li

We develop high-dimensional goodness-of-fit tests for elliptical models by testing radial--directional independence after affine standardization. The method forms coordinatewise correlations between the log-radius and directional…

Methodology · Statistics 2026-05-06 Haoran Zhang , Long Feng

We consider the optimal control problem for null curves in de Sitter 3-space defined by a functional which is linear in the curvature of the trajectory. We show how techniques based on the method of moving frames and exterior differential…

Differential Geometry · Mathematics 2014-11-18 Emilio Musso , Lorenzo Nicolodi

The Linear Independence hypothesis (LI), which states roughly that the imaginary parts of the critical zeros of Dirichlet L-functions are linearly independent over the rationals, is known to have interesting consequences in the study of…

Number Theory · Mathematics 2015-02-19 Byungchul Cha , Daniel Fiorilli , Florent Jouve

Finite element approximation to a decoupled formulation for the quad--curl problem is studied in this paper. The difficulty of constructing elements with certain conformity to the quad--curl problems has been greatly reduced. For convex…

Numerical Analysis · Mathematics 2021-12-09 Shuhao Cao , Long Chen , Xuehai Huang

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

This paper presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "simple" in the sense that any three curves have no common…

Computational Geometry · Computer Science 2020-09-03 Jyh-Ming Lien , Vikram Sharma , Gert Vegter , Chee Yap

We exhibit a surprising relationship between elliptic gradient systems of PDEs, multi-marginal Monge-Kantorovich optimal transport problem, and multivariable Hardy-Littlewood inequalities. We show that the notion of an orientable elliptic…

Analysis of PDEs · Mathematics 2013-08-22 Nassif Ghoussoub , Brendan Pass

We study the counting function of rational approximations with given bounds on the denominator and satisfying the critical Dirichlet exponent on the sphere $S^d$, $d\geq 3$. We give an effective estimate for this counting function, with an…

Number Theory · Mathematics 2025-12-23 Zouhair Ouaggag

In this paper, we present a fast divergence-free spectral algorithm (FDSA) for the curl-curl problem. Divergence-free bases in two and three dimensions are constructed by using the generalized Jacobi polynomials. An accurate spectral method…

Numerical Analysis · Mathematics 2023-08-25 Lechang Qin , Changtao Sheng , Zhiguo Yang

We establish a congruence formula between $p$-adic logarithms of Heegner points for two elliptic curves with the same mod $p$ Galois representation. As a first application, we use the congruence formula when $p=2$ to explicitly construct…

Number Theory · Mathematics 2017-11-29 Daniel Kriz , Chao Li

We consider an optimal control problem that entails the minimization of a nondifferentiable cost functional, fractional diffusion as state equation and constraints on the control variable. We provide existence, uniqueness and regularity…

Numerical Analysis · Mathematics 2017-04-05 Enrique Otárola , Abner J. Salgado

Many problems in machine learning can be formulated as optimizing a convex functional over a vector space of measures. This paper studies the convergence of the mirror descent algorithm in this infinite-dimensional setting. Defining Bregman…

Optimization and Control · Mathematics 2022-10-12 Pierre-Cyril Aubin-Frankowski , Anna Korba , Flavien Léger
‹ Prev 1 4 5 6 7 8 10 Next ›