English
Related papers

Related papers: Algebraic Independence in Positive Characteristic …

200 papers

Solving polynomials is a fundamental computational problem in mathematics. In the real setting, we can use Descartes' rule of signs to efficiently isolate the real roots of a square-free real polynomial. In this paper, we translate this…

Number Theory · Mathematics 2022-03-15 Josué Tonelli-Cueto

In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…

alg-geom · Mathematics 2008-02-03 F. Acquistapace , C. Andradas , F. Broglia

Let $K$ be a finite extension of $\mathbb{Q}_p$, and let $f_1(z),\ldots, f_m(z) \in K[[z]]$ such that, for every $1 \leq i \leq m$, $f_i(z)$ is a solution of a differential operator $\mathcal{L}_i \in E_p[d/dz]$, where $E_p$ is the field of…

Number Theory · Mathematics 2025-07-30 Daniel Vargas-Montoya

Let $F(x)=(f_1(x), \dots, f_m(x))$ be such that $1, f_1, \dots, f_m$ are linearly independent polynomials with real coefficients. Based on ideas of Bachoc, DeCorte, Oliveira and Vallentin in combination with estimating certain oscillatory…

Combinatorics · Mathematics 2018-11-20 Mohammad Bardestani , Keivan Mallahi-Karai

Let $K$ be an algebraically closed field of characteristic 0 and $f\in K[t]$ a polynomial of degree $d\geq 2$. There exists a local conjugacy $\psi_f(t)\in tK[[1/t]]$ such that $\psi_f(t^d)=f(\psi_f(t))$. It has been known that $\psi_f$ is…

Number Theory · Mathematics 2013-10-10 Khoa Nguyen

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

Computational Complexity · Computer Science 2021-07-15 Pascal Koiran , Mateusz Skomra

In a recent paper it has been established that over an Artinian ring R all two-dimensional polynomial automorphisms having Jacobian determinant one are tame if R is a Q-algebra. This is a generalization of the famous Jung-Van der Kulk…

Commutative Algebra · Mathematics 2012-10-09 Joost Berson

The article continues the work on the description of integrable nonlinear chains with three independent variables of the following form $u^j_{n+1,x}=u^j_{n,x}+f(u^{j+1}_{n}, u^{j}_n,u^j_{n+1 },u^{j-1}_{n+1})$ by the presence of a hierarchy…

Exactly Solvable and Integrable Systems · Physics 2023-06-27 I T Habibullin , A R Khakimova

Poisson brackets (P.b) are the natural initial terms for the deformation quantization of commutative algebras. There is an open problem whether any Poisson bracket on the polynomial algebra of $n$ variables can be quantized. It is known…

q-alg · Mathematics 2008-02-03 J. Donin , L. Makar-Limanov

In this paper we study algebraic branching programs (ABPs) with restrictions on the order and the number of reads of variables in the program. Given a permutation $\pi$ of $n$ variables, for a $\pi$-ordered ABP ($\pi$-OABP), for any…

Computational Complexity · Computer Science 2010-02-09 Maurice Jansen , Youming Qiao , Jayalal Sarma

Given a random sample of size $n$ from a $p$ dimensional random vector, where both $n$ and $p$ are large, we are interested in testing whether the $p$ components of the random vector are mutually independent. This is the so-called complete…

Statistics Theory · Mathematics 2022-01-24 Yongcheng Qi , Yingchao Zhou

We first quantize the Witt algebra in characteristic 0. Then, we consider the reduction modulo p of our formulas. This gives polynomial deformations of the restricted envelopping algebra of the Witt algebra. By this way, we get new families…

Quantum Algebra · Mathematics 2007-05-23 Cyril Grunspan

It is known from the work of Shearer (1985) (and also Scott and Sokal (2005)) that the independence polynomial $Z_G(\lambda)$ of a graph $G$ of maximum degree at most $d+1$ does not vanish provided that $\vert{\lambda}\vert \leq…

Discrete Mathematics · Computer Science 2022-11-15 Ferenc Bencs , Péter Csikvári , Piyush Srivastava , Jan Vondrák

For a fixed prime $p$, let $\mathbb C_p$ denote the complex $p$-adic numbers. For polynomials $A,B\in \mathbb C_p[x]$ we consider decompositions $A(x)f^2(x)+B(x)g^2(x)=1$ of entire functions $f,\,g$ on $\mathbb C_p$ and try to improve an…

Number Theory · Mathematics 2010-07-30 Eberhard Mayerhofer

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Optimization and Control · Mathematics 2008-01-24 Didier Henrion

Let k be a field of characteristic zero. Let phi be a k-endomorphism of the polynomial algebra k[x_1,...,x_n]. It is known that phi is an automorphism if and only if it maps irreducible polynomials to irreducible polynomials. In this paper…

Commutative Algebra · Mathematics 2013-06-21 Piotr Jedrzejewicz

We give a criterion for the Kac conjecture asserting that the free term of the polynomial counting the absolutely indecomposable representations of a quiver over a finite field of given dimension coincides with the corresponding root…

Representation Theory · Mathematics 2007-08-09 Sergey Mozgovoy

This paper is concerned with the construction of a small, but non-trivial, example of a polynomial identity algebra, which we call the \emph{Jackson algebra}, that will be used in sequels to this paper to study non-commutative arithmetic…

Rings and Algebras · Mathematics 2023-08-29 Daniel Larsson

Testing (conditional) independence of multivariate random variables is a task central to statistical inference and modelling in general - though unfortunately one for which to date there does not exist a practicable workflow. State-of-art…

Machine Learning · Statistics 2018-05-01 Samuel Burkart , Franz J Király

A linear code is said to be $\Delta$-divisible if the Hamming weights of all its codewords are divisible by $\Delta$. The $p$-adic valuation of a code is defined as the greatest integer $t$ such that the code is $p^t$-divisible. In this…

Combinatorics · Mathematics 2026-05-20 Hexiang Huang , Haihua Deng , Sihuang Hu
‹ Prev 1 3 4 5 6 7 10 Next ›