English
Related papers

Related papers: An Explicit Upper Bound for Modulus of Divided Dif…

200 papers

We extend recent computer-assisted design and analysis techniques for first-order optimization over structured functions--known as performance estimation--to apply to structured sets. We prove "interpolation theorems" for smooth and…

Optimization and Control · Mathematics 2024-11-20 Alan Luner , Benjamin Grimmer

We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…

Algebraic Geometry · Mathematics 2019-11-07 Damian Rössler

We consider Jordan curves of the form $\gamma=\cup_{j=1}^n \gamma_j$ on the Riemann sphere for which each $\gamma_j$ is a hyperbolic geodesic in $(\widehat{\mathbb C} \smallsetminus \gamma)\cup \gamma_j$. These Jordan curves are…

Complex Variables · Mathematics 2025-10-03 Donald Marshall , Steffen Rohde , Yilin Wang

We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…

Combinatorics · Mathematics 2025-02-19 Michalis Kokkinos

To each multiple point $p$ in a line arrangement $ \mathcal A$ in the complex projective plane we associate a local derivation $\tilde D_p \in D_0( \mathcal A)$. We show first that these derivations span the graded module of derivations…

Algebraic Geometry · Mathematics 2025-05-21 Alexandru Dimca

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

Combinatorics · Mathematics 2021-11-02 Zhicheng Gao

The classical perceptron rule provides a varying upper bound on the maximum margin, namely the length of the current weight vector divided by the total number of updates up to that time. Requiring that the perceptron updates its internal…

Machine Learning · Computer Science 2011-05-31 Constantinos Panagiotakopoulos , Petroula Tsampouka

Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…

Classical Analysis and ODEs · Mathematics 2025-07-04 T. M. Dunster

Consider the Fourier restriction operator associated to a curve in $R^d$, $d\ge 3$. We prove for various classes of curves the endpoint restricted strong type estimate with respect to affine arclength measure on the curve. An essential…

Classical Analysis and ODEs · Mathematics 2016-04-20 Jong-Guk Bak , Daniel M. Oberlin , Andreas Seeger

Let C be a commutative ring with unity. In this article, we show that every Jordan derivation over an upper triangular matrix algebra T_n(C) is an inner derivation. Further, we extend the result for Jordan derivation on full matrix algebra…

Rings and Algebras · Mathematics 2018-03-22 Arindam Ghosh , Om Prakash

Numerical integration over the implicitly defined domains is challenging due to topological variances of implicit functions. In this paper, we use interval arithmetic to identify the boundary of the integration domain exactly, thus getting…

Numerical Analysis · Mathematics 2024-12-20 Tianhui Yang , Ammar Qarariyah , Hongmei Kang , Jiansong Deng

This paper deals with a non-standard finite difference scheme defined on a quasi-uniform mesh for approximate solutions of the MHD boundary layer flow of an incompressible fluid past a flat plate for a wide range of the magnetic parameter.…

Numerical Analysis · Mathematics 2020-03-16 Riccardo Fazio , Alessandra Jannelli

In a Euclidean Jordan algebra V of rank n which carries the trace inner product, to each element x we associate the eigenvalue vector whose components are the eigenvalues of x written in the decreasing order. For any number p between (and…

Functional Analysis · Mathematics 2018-09-17 Muddappa Seetharama Gowda

We give optimal estimates on the variation of the differential and modular heights within an isogeny class of abelian varieties defined over the function field of a curve (in any characteristic). We also prove a parallelogram inequality for…

Number Theory · Mathematics 2025-03-19 Richard Griffon , Samuel Le Fourn , Fabien Pazuki

Computation of the interleaving distance between persistence modules is a central task in topological data analysis. For $1$-parameter persistence modules, thanks to the isometry theorem, this can be done by computing the bottleneck…

Computational Geometry · Computer Science 2019-10-07 Tamal K. Dey , Cheng Xin

Several inequalities for the isoperimetric ratio for plane curves are derived. In particular, we obtain interpolation inequalities between the deviation of curvature and the isoperimetric ratio. As applications, we study the large-time…

Analysis of PDEs · Mathematics 2018-11-27 Takeyuki Nagasawa , Kohei Nakamura

Given n general points p_1, p_2,..., p_n \in P^r, it is natural to ask whether there is a curve of given degree d and genus g passing through them; by counting dimensions a natural conjecture is that such a curve exists if and only if \[n…

Algebraic Geometry · Mathematics 2019-04-29 Eric Larson

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

Combinatorics · Mathematics 2026-01-05 Robert Coulter , Steven Senger

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

Commutative Algebra · Mathematics 2016-02-23 M. Domokos

This paper proposes an easy-to-compute upper bound for the overlap index between two probability distributions without requiring any knowledge of the distribution models. The computation of our bound is time-efficient and memory-efficient…

Machine Learning · Computer Science 2024-12-02 Hao Fu , Prashanth Krishnamurthy , Siddharth Garg , Farshad Khorrami
‹ Prev 1 8 9 10 Next ›