中文
相关论文

相关论文: Reconstruction of a polynomial from its Radon proj…

200 篇论文

The p-adic valuation of a polynomial can be given by its valuation tree. This work describes the 2-adic valuation tree of the general degree 2 polynomial in 2 variables.

数论 · 数学 2024-12-24 Shubham

A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called quadratic if the degrees of its polynomials are not greater than two. In…

代数几何 · 数学 2015-07-08 Ruslan Sharipov

The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…

数值分析 · 数学 2025-10-20 Vladimir Chelyshkov

An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…

数值分析 · 数学 2015-05-05 Vahagn Vardanyan

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

度量几何 · 数学 2007-05-23 Hartwig Bosse , Martin Groetschel , Martin Henk

We consider a sequence of polynomials $\{P_n\}_{n \geq 0}$ satisfying a special $R_{II}$ type recurrence relation where the zeros of $P_n$ are simple and lie on the real line. It turns out that the polynomial $P_n$, for any $n \geq 2$, is…

经典分析与常微分方程 · 数学 2017-03-16 Mourad E. H. Ismail , Alagacone Sri Ranga

We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…

数论 · 数学 2023-05-11 Zhiguo Ding , Michael E. Zieve

A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called cubic if the degrees of its polynomials are not greater than three. In…

代数几何 · 数学 2015-08-20 Ruslan Sharipov

We prove that, over any field, the dimension of the indeterminacy locus of a rational transformation $f$ of $P^n$ which is defined by monomials of the same degree $d$ with no common factors is at least $(n-2)/2$, provided that the degree of…

代数几何 · 数学 2014-01-14 Olivier Debarre , Bodo Lass

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

交换代数 · 数学 2018-01-18 Beata Hejmej

Given a birational map in the three dimensional projective space defined by monomials of degree $d$, we prove that its inverse is defined by monomials of degree at most $d^2-d+1$.

代数几何 · 数学 2022-06-13 Thiago Fassarella , Nivaldo Medeiros

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

动力系统 · 数学 2014-10-02 Vladimir Dragovic , Katarina Kukic

Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…

数论 · 数学 2025-11-07 Péter P. Varjú , Max Wenqiang Xu

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

组合数学 · 数学 2017-06-30 Yi Bo

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

组合数学 · 数学 2017-02-14 Seongmin Ok , Peter Tittmann

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

数论 · 数学 2008-11-26 Xiang-dong Hou , Gary L. Mullen

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

交换代数 · 数学 2007-06-11 Arnaud Bodin

We contribute to the exceptional APN conjecture by showing that no polynomial of degree m = 2 r (2 {\ell} + 1) where gcd(r, {\ell}) 2, r 2, {\ell} 1 with a nonzero second leading coefficient can be APN over infinitely many extensions of the…

数论 · 数学 2022-07-29 Yves Aubry , Fabien Herbaut , Ali Issa

We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…

数值分析 · 数学 2018-05-09 S. Chandrasekaran , C. H. Gorman , H. N. Mhaskar

Attenuated Radon projections with respect to the weight function $W_\mu(x,y) = (1-x^2-y^2)^{\mu-1/2}$ are shown to be closely related to the orthogonal expansion in two variables with respect to $W_\mu$. This leads to an algorithm for…

数值分析 · 数学 2007-05-23 Yuan Xu , Oleg Tischenko , Christoph Hoeschen