English
Related papers

Related papers: A new bound for smooth spline spaces

200 papers

Let $SL_2$ be the rank one simple algebraic group defined over an algebraically closed field $k$ of characteristic $p>0$. The paper presents a new method for computing the dimension of the cohomology spaces $\text{H}^n(SL_2,V(m))$ for Weyl…

Representation Theory · Mathematics 2015-08-25 Klaus Lux , Nham V. Ngo , Yichao Zhang

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

Numerical Analysis · Mathematics 2024-12-05 Jeffrey Galkowski

Consider the regular $n$-simplex $\Delta_n$ - it is formed by the convex-hull of $n+1$ points in Euclidean space, with each pair of points being in distance exactly one from each other. We prove an exact bound on the width of $\Delta_n$…

Computational Geometry · Computer Science 2023-01-09 Sariel Har-Peled , Eliot W. Robson

We provide polynomial upper bounds for the minimal sizes of distal cell decompositions in several kinds of distal structures, particularly weakly $o$-minimal and $P$-minimal structures. The bound in general weakly $o$-minimal structures…

Logic · Mathematics 2026-02-11 Aaron Anderson

In the problem of semialgebraic range searching, we are to preprocess a set of points in $\mathbb{R}^D$ such that the subset of points inside a semialgebraic region described by $O(1)$ polynomial inequalities of degree $\Delta$ can be found…

Computational Geometry · Computer Science 2022-03-16 Peyman Afshani , Pingan Cheng

Let $V$ be a vector space over a field $k, P:V\to k, d\geq 3$. We show the existence of a function $C(r,d)$ such that $rank (P)\leq C(r,d)$ for any field $k,char (k)>d$, a finite-dimensional $k$-vector space $V$ and a polynomial $P:V\to k$…

Algebraic Geometry · Mathematics 2018-03-15 David Kazhdan , Tamar Ziegler

We study a Schwarz-Pick type inequality for the Schur-Agler class $SA(B_{\delta})$. In our operator theoretical approach, von Neumann's inequality for a class of generic tuples of $2\times 2$ matrices plays an important role rather than…

Functional Analysis · Mathematics 2024-06-24 Kenta Kojin

Let $S = K[x_1, ..., x_n ]$ be a polynomial ring over a field $K$, and $E = K < y_1, ..., y_n >$ an exterior algebra. The "linearity defect" $ld_E(N)$ of a finitely generated graded $E$-module $N$ measures how far $N$ departs from…

Commutative Algebra · Mathematics 2007-05-23 Ryota Okazaki , Kohji Yanagawa

Assume that $V_h$ is a space of piecewise polynomials of degree less than $r\geq 1$ on a family of quasi-uniform triangulation of size $h$. Then the following well-known upper bound holds for a sufficiently smooth function $u$ and $p\in [1,…

Numerical Analysis · Mathematics 2011-06-23 Qun Lin , Hehu Xie , Jinchao Xu

The Cauchy- and periodic boundary value problem for the nonlinear Schroedinger equations in $n$ space dimensions [u_t - i\Delta u = (\nabla \bar{u})^{\beta}, |\beta|=m \ge 2, u(0)=u_0 \in H^{s+1}_x] is shown to be locally well posed for $s…

Analysis of PDEs · Mathematics 2007-05-23 Axel Gruenrock

We derive universal lower and upper bounds for max-min and min-max problems (also known as polarization) for the potential of spherical $(k,k)$-designs and provide certain examples, including unit-norm tight frames, that attain these…

Metric Geometry · Mathematics 2025-06-02 S. Borodachov , P. Boyvalenkov , P. Dragnev. D. Hardin. E. Saff , M. Stoyanova

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

Number Theory · Mathematics 2016-11-16 Aleksandar Ivić

We study the Schr\"odinger equations $-\Delta u + V(x)u = f(x,u)$ in $\mathbb{R}^N$ and $-\Delta u - \lambda u = f(x,u)$ in a bounded domain $\Omega\subset\mathbb{R}^N$. We assume that $f$ is superlinear but of subcritical growth and…

Analysis of PDEs · Mathematics 2016-09-16 Francisco Odair de Paiva , Wojciech Kryszewski , Andrzej Szulkin

The SL(3,C)-covariant 9-dimensional equation for a free 3-spinor particle is transformed into the Dirac-like form (p_A\delta^A - M)\Psi=0. However, the corresponding \delta matrices do not satisfy the Dirac algebra. It is shown that…

Mathematical Physics · Physics 2007-05-23 A. V. Solov'yov

In this paper, the author solves the long term open problem of Kerzman on sup-norm estimate for Cauchy-Riemann equation on polydisc in $n$-dimensional complex space. The problem has been open since 1971. He also extends and solves the…

Complex Variables · Mathematics 2023-07-12 Song-Ying Li

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

Commutative Algebra · Mathematics 2022-04-22 Yihui Liang

We consider the problem -\Delta u - g(u) = \lambda u, u \in H^1(\R^N), \int_{\R^N} u^2 = 1, \lambda\in\R, in dimension $N\ge2$. Here $g$ is a superlinear, subcritical, possibly nonhomogeneous, odd nonlinearity. We deal with the case where…

Analysis of PDEs · Mathematics 2015-10-28 Thomas Bartsch , Sébastien de Valeriola

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

Riemann-Hilbert problems are jump problems for holomorphic functions along given interfaces. They arise in various contexts, e.g. in the asymptotic study of certain nonlinear partial differential equations and in the asymptotic analysis of…

Complex Variables · Mathematics 2024-04-05 Haakan Hedenmalm

We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…

Computational Complexity · Computer Science 2022-12-27 Fulvio Gesmundo , Purnata Ghosal , Christian Ikenmeyer , Vladimir Lysikov