English
Related papers

Related papers: Off-diagonal estimates for cube skeletons maximal …

200 papers

Let X be a geometrically integral projective cubic hypersurface defined over the rationals, with dimension D and singular locus of dimension at most D-4. For any \epsilon>0, we show that X contains O(B^{D+\epsilon}) rational points of…

Number Theory · Mathematics 2008-04-16 T. D. Browning

In this paper, we introduce a criterion for maximal operators associated with Fourier multipliers to be bounded on $L^p(\mathbb{R}^d)$. Noteworthy examples satisfying the criterion are multipliers of the Mikhlin type or limited decay which…

Classical Analysis and ODEs · Mathematics 2023-02-21 Jin Bong Lee , Jinsol Seo

The aim of this work is to develop a systematic manner to close overdetermined systems arising from conformal Killing tensors (CKT). The research performs this action for 1-tensor and 2-tensors. This research makes it possible to develop a…

Differential Geometry · Mathematics 2007-05-23 Thomas Branson , Alfredo Villanueva

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…

Social and Information Networks · Computer Science 2015-02-10 Vladan Mlinar

This paper is devoted to the study of noncommutative maximal operators with rough kernels. More precisely, we prove the weak type $(1,1)$ boundedness for noncommutative maximal operators with rough kernels. The proof of weak type (1,1)…

Classical Analysis and ODEs · Mathematics 2022-09-01 Xudong Lai

In this note we describe some recent advances in the area of maximal function inequalities. We also study the behaviour of the centered Hardy-Littlewood maximal operator associated to certain families of doubling, radial decreasing…

Classical Analysis and ODEs · Mathematics 2013-02-12 J. M. Aldaz , J. Pérez Lázaro

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…

Computational Geometry · Computer Science 2008-12-03 Andrea Vattani

In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical…

Optimization and Control · Mathematics 2026-05-05 TaeHo Yoon , Benjamin Grimmer

In this paper, we present several sharp upper bounds for the numerical radii of the diagonal and off-diagonal parts of the $2\times2$ block operator matrix $\begin{bmatrix}A&B\\ C&D\end{bmatrix}$. Among extensions of some results of…

Functional Analysis · Mathematics 2018-11-01 M. Ghaderi Aghideh , M. S. Moslehian , J. Rooin

In this article, we address endpoint issues for the bilinear spherical maximal functions. We obtain borderline restricted weak type estimates for the well studied bilinear spherical maximal function…

Classical Analysis and ODEs · Mathematics 2024-01-17 Ankit Bhojak , Surjeet Singh Choudhary , Saurabh Shrivastava , Kalachand Shuin

We prove new endpoint bounds for the lacunary spherical maximal operator and as a consequence obtain almost everywhere pointwise convergence of lacunary spherical means for functions locally in $L\log\log\log L(\log\log\log\log…

Classical Analysis and ODEs · Mathematics 2024-07-24 Laura Cladek , Ben Krause

We consider nonconforming methods for symmetric elliptic problems and characterize their quasi-optimality in terms of suitable notions of stability and consistency. The quasi-optimality constant is determined and the possible impact of…

Numerical Analysis · Mathematics 2017-10-11 Andreas Veeser , Pietro Zanotti

In this paper, we establish some upper bounds for numerical radius inequalities including of $2\times 2$ operator matrices and their off-diagonal parts. Among other inequalities, it is shown that if $T=\left[\begin{array}{cc} 0&X, Y&0…

Functional Analysis · Mathematics 2018-11-14 Mojtaba Bakherad , Khalid Shebrawi

We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the…

Symbolic Computation · Computer Science 2010-11-24 Xavier Dahan , Abdulilah Kadri , Éric Schost

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 establish a parameter-dependent pseudo-differential calculus on an infinite cylinder, regarded as a manifold with conical exits to infinity. The parameters are involved in edge-degenerate form, and we formulate the operators in terms of…

Analysis of PDEs · Mathematics 2009-01-28 Jamil Abed , Bert Wolfgang Schulze

Due to the multi-linearity of tensors, most algorithms for tensor optimization problems are designed based on the block coordinate descent method. Such algorithms are widely employed by practitioners for their implementability and…

Optimization and Control · Mathematics 2022-01-14 Ke Ye , Shenglong Hu

We prove the validity of maximum principles for a class of fully nonlinear operators on unbounded subdomains $\Omega \subset \mathbb R^n$ of cylindrical type. The main structural assumption is the uniform ellipticity of the operator along…

Analysis of PDEs · Mathematics 2019-02-05 Italo Capuzzo Dolcetta , Antonio Vitolo

For H a separable infinite dimensional complex Hilbert space, we prove that every B(H) operator has a basis with respect to which its matrix representation has a universal block tridiagonal form with block sizes given by a simple…

Functional Analysis · Mathematics 2019-11-05 Sasmita Patnaik , Srdjan Petrovic , Gary Weiss

This paper is a continuation of \ct{cmf16} where an efficient algorithm for computing the maximal eigenpair was introduced first for tridiagonal matrices and then extended to the irreducible matrices with nonnegative off-diagonal elements.…

Probability · Mathematics 2017-06-26 Mu-Fa Chen
‹ Prev 1 8 9 10 Next ›