English
Related papers

Related papers: Piecewise polynomials on polyhedral complexes

200 papers

The theory of moduli of morphisms on P^n generalizes the study of rational maps on P^1. This paper proves three results about the space of morphisms on P^n of degree d > 1, and its quotient by the conjugation action of PGL(n+1). First, we…

Dynamical Systems · Mathematics 2009-08-24 Alon Levy

Given a fixed $p\neq 2$, we prove a simple and effective characterization of all radial multipliers of $\cF L^p(\Bbb R^d)$, provided that the dimension $d$ is sufficiently large. The method also yields new $L^q$ space-time regularity…

Classical Analysis and ODEs · Mathematics 2012-03-20 Yaryong Heo , Fedor Nazarov , Andreas Seeger

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

Number Theory · Mathematics 2025-12-01 Foivos Chnaras , Noah Kupinsky

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

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

In the paper we investigate locally symmetric polynomial metrics in special cases of Riemannian and Finslerian surfaces. The Riemannian case will be presented by a collection of basic results (regularity of second root metrics) and formulas…

Differential Geometry · Mathematics 2024-03-15 Csaba Vincze , Márk Oláh , Ábris Nagy

It is known after Jouanolou that a general holomorphic foliation of degree $\geq2$ in projective space has no algebraic leaf. We give formulas for the degrees of the subvarieties of the parameter space of one-dimensional foliations that…

Algebraic Geometry · Mathematics 2010-03-31 Viviana Ferrer , Israel Vainsencher

We consider a basis of square integrable functions on a rectangle, contained in $R^2$, constructed with Legendre polynomials, suitable, for instance, for the analogical description of images on the plane or in other fields of application of…

Mathematical Physics · Physics 2024-10-16 Enrico Celeghini , Manuel Gadella , Mariano A. del Olmo

Event--selected $C^r$ vector fields yield piecewise-differentiable flows, which possess a continuous and piecewise-linear Bouligand (or B-)derivative; here we provide an algorithm for computing this B-derivative. The number of "pieces" of…

Dynamical Systems · Mathematics 2016-12-09 Shai Revzen , Samuel A Burden

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

Optimization and Control · Mathematics 2021-06-14 Yibo Xu , Warren Adams , Akshay Gupte

We show that a $d$-dimensional polyhedron $S$ in $\real^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials.…

Algebraic Geometry · Mathematics 2010-02-05 Gennadiy Averkov , Ludwig Bröcker

We define a geometrically meaningful compactification of the moduli space of smooth plane curves, which can be calculated explicitly. The basic idea is to regard a plane curve D in P^2 as a pair (P^2,D) of a surface together with a divisor,…

Algebraic Geometry · Mathematics 2007-05-23 Paul Hacking

We give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…

Computational Complexity · Computer Science 2015-03-13 Ilias Diakonikolas , Rocco A. Servedio , Li-Yang Tan , Andrew Wan

Let R and S be two irreducible root systems spanning the same vector space and having the same Weyl group W, such that S (but not necessarily R) is reduced. For each such pair (R,S) we construct a family of W-invariant orthogonal…

Quantum Algebra · Mathematics 2007-05-23 Ian G. Macdonald

We show that on the $d$-dimensional cube $I^d\equiv [0,1]^d$ the discrete moduli of smoothness which use only the values of the function on a diadic mesh are sufficient to determine the moduli of smoothness of that function. As an important…

Numerical Analysis · Mathematics 2014-08-20 Z. Ditzian , A. Prymak

The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in…

Symbolic Computation · Computer Science 2020-01-01 Joachim von zur Gathen , Mark Giesbrecht , Konstantin Ziegler

We find a formula, in terms of n, d and p, for the value of the F-pure threshold for the generic homogeneous polynomial of degree d in n variables over an algebraically closed field of characteristic p. We also show that, in every…

Commutative Algebra · Mathematics 2022-07-26 Karen E. Smith , Adela Vraciu

Properties of 2-adic valuation sequences for general quadratic polynomials with integer coefficients are determined directly from the coefficients. These properties include boundedness or unboundedness, periodicity, and valuations at…

Number Theory · Mathematics 2021-09-01 Will Boultinghouse , Jane Long , Olena Kozhushkina , Justin Trulen

Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…

Quantum Physics · Physics 2022-05-25 Arturas Acus , Adolfas Dargys

The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at the…

Combinatorics · Mathematics 2023-12-12 R. L. Streit