English
Related papers

Related papers: Piecewise polynomials on polyhedral complexes

200 papers

In this paper, we give some results on closed polynomials and factorially closed polynomial in $n$ variables. In particular, we give a characterization of factorially closed polynomials in $n$ variables over an algebraically closed field…

Algebraic Geometry · Mathematics 2019-07-12 Chiaki Kitazawa , Hideo Kojima , Takanrori Nagamine

For n greater than or equal to 4, the square of the volume of an n-simplex satisfies a polynomial relation with coefficients depending on the squares of the areas of 2-faces of this simplex. First, we compute the minimal degree of such…

Metric Geometry · Mathematics 2024-11-20 Alexander A. Gaifullin

Given $k \ge 2$ polynomials in $d \ge 1$ variables with coefficients in a field of characteristic $0$, such that no two are linearly dependent, we show that for any integer $r$ greater than $\max\left\{k {k-1 \choose 2}, 2\right\}$, the…

Commutative Algebra · Mathematics 2025-07-15 Alexandru Crăciun

A polynomial of degree $\ge 2$ with coefficients in the ring of $p$-adic numbers $\mathbb{Z}_p$ is studied as a dynamical system on $\mathbb{Z}_p$. It is proved that the dynamical behavior of such a system is totally described by its…

Dynamical Systems · Mathematics 2010-11-01 Fan Ai-Hua , Lingmin Liao

The present paper provides a general formula for the dimension of spline space over T-meshes using smoothing cofactor-conformality method. And we introduce a new notion, Diagonalizable T-mesh, over which the dimension formula is only…

Algebraic Geometry · Mathematics 2012-10-22 Xin Li

This paper presents an efficient approach to image segmentation that approximates the piecewise-smooth (PS) functional in [12] with explicit solutions. By rendering some rational constraints on the initial conditions and the final solutions…

Computer Vision and Pattern Recognition · Computer Science 2016-12-09 Huihui Song , Yuhui Zheng , Kaihua 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

In this paper we extend the works of Tancer and of Malgouyres and Franc\'es, showing that $(d,k)$-collapsibility is NP-complete for $d\geq k+2$ except $(2,0)$. By $(d,k)$-collapsibility we mean the following problem: determine whether a…

Computational Geometry · Computer Science 2019-04-08 Giovanni Paolini

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

Discrete Mathematics · Computer Science 2025-09-29 Mehul Bafna , Shaghik Amirian

We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…

Machine Learning · Computer Science 2013-05-15 Siu-On Chan , Ilias Diakonikolas , Rocco A. Servedio , Xiaorui Sun

A new scheme is proposed to construct an n-times differentiable function extension of an n-times differentiable function defined on a smooth domain D in d-dimensions. The extension scheme relies on an explicit formula consisting of a linear…

Numerical Analysis · Mathematics 2023-12-05 Charles L. Epstein , Fredrik Fryklund , Shidong Jiang

Let $\Sigma(f)$ be critical points of a polynomial $f \in \mathbb{K}[x,y]$ in the plane $\mathbb{K}^2$, where $\mathbb{K}$ is $\mathbb{R}$ or $\mathbb{C}$. Our goal is to study the critical point map $\mathfrak{S}_d$, by sending polynomials…

Algebraic Geometry · Mathematics 2022-06-14 John A. Arredondo , Jesús Muciño-Raymundo

We consider cubic polynomials f(z)=z^3+az+b defined over the function field C(L), with a marked point of period N and multiplier L. In the case N=1, there are infinitely many such objects, and in the case N>2, only finitely many. The case…

Dynamical Systems · Mathematics 2019-08-15 Patrick Ingram

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

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

Information Theory · Computer Science 2022-12-12 Yue Yu , Pavel Loskot

We present a Hilbert space geometric approach to the problem of characterizing the positive bivariate trigonometric polynomials that can be represented as the square of a two variable polynomial possessing a certain stability requirement,…

Complex Variables · Mathematics 2016-03-21 Jeffrey S. Geronimo , Plamen Iliev , Greg Knese

We notice that for $0<d\le 6$ the Poincar\'e polynomial of Simpson moduli space $M_{dm + 1}(\mathbb P_2)$ is divisible by the Poincar\'e polynomial of the projective space $\mathbb P_{3d-1}$. A somehow regular behaviour of the difference of…

Algebraic Geometry · Mathematics 2018-05-08 Oleksandr Iena

Based on the method developed in [K.~H.~Phan and T.~Riemann, Phys.\ Lett.\ B {\bf 791} (2019) 257], detailed analytic results for scalar one-loop two-, three-, four-point integrals in general $d$-dimension are presented in this paper. The…

High Energy Physics - Phenomenology · Physics 2020-06-24 Khiem Hong Phan

The Jack symmetric polynomials $P_\lambda^{(\alpha)}$ form a class of symmetric polynomials which are indexed by a partition $\lambda$ and depend rationally on a parameter $\alpha$. They reduced to the Schur polynomials when $\alpha=1$, and…

alg-geom · Mathematics 2008-02-03 Hiraku Nakajima

Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

Number Theory · Mathematics 2018-04-20 Alexander Dunn , Nicolas Robles
‹ Prev 1 4 5 6 7 8 10 Next ›