English
Related papers

Related papers: Solving homogeneous linear equations over polynomi…

200 papers

We investigate the notion of \textit{semi-nil clean} rings, defined as those rings in which each element can be expressed as a sum of a periodic and a nilpotent element. Among our results, we show that if $R$ is a semi-nil clean NI ring,…

Rings and Algebras · Mathematics 2024-09-04 M. H. Bien , P. V. Danchev , M. Ramezan-Nassab

We consider fine G-gradings on M_n(C) (i.e. gradings of the matrix algebra over the complex numbers where each component is 1 dimensional). Groups which provide such a grading are known to be solvable. We consider the T-ideal of G-graded…

Rings and Algebras · Mathematics 2007-10-31 Eli Aljadeff , Darrell Haile , Michael Natapov

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X of S, decide whether each element of S has at most one factorization over X. To…

Discrete Mathematics · Computer Science 2012-05-07 Julien Cassaigne , Francois Nicolas

We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…

Computational Geometry · Computer Science 2020-09-30 Boris Aronov , Esther Ezra , Micha Sharir

Hilbert's ternary quartic theorem states that every nonnegative degree 4 homogeneous polynomial in three variables can be written as a sum of three squares of homogeneous quadratic polynomials. We give a linear-algebraic approach to…

Algebraic Geometry · Mathematics 2019-05-14 Anatolii Grinshpan , Hugo J. Woerdeman

The classical approach of solvability using group theory is well known and one original motivation is to solve polynomials by radicals. Radicals are square, cube, square root, cube root etc of the original coefficients for the polynomial. A…

Geophysics · Physics 2011-01-31 August Lau , Chuan Yin

We are interested in finding a nonlinear polynomial $P$ on $\mathbb{R}^n$ that solves the minimal surface equation. Even though no explicit solution is found in this article, we investigate constraints that a polynomial solution must obey.…

Differential Geometry · Mathematics 2026-03-18 Yifan Guo

Given a finitely generated subgroup G of a ring R we provide a finite subset of G such that if each element of this set satisfies some cubic polynomial equation in one variable over the center Z of R then the subring generated by G has…

Group Theory · Mathematics 2015-05-12 A. Grishkov , R. Oliveira , S. Sidki

Let $k$ be a commutative Noetherian ring, and $k[S]$ the polynomial ring whose indeterminates are parameterized by elements in a set $S$. We show that $k[S]$ is Noetherian up to highly homogenous actions of groups. In particular, there is a…

Representation Theory · Mathematics 2025-08-25 Liping Li , Yinhe Peng , Zhengjun Yuan

In this paper we completely classify which graded polynomial R-algebras in finitely many even degree variables can occur as the singular cohomology of a space with coefficients in R, a 1960 question of N. E. Steenrod, for a commutative ring…

Algebraic Topology · Mathematics 2008-12-30 Kasper K. S. Andersen , Jesper Grodal

Let $X$ be a nonempty set and $\mathcal{P}=\{X_i\colon i\in I\}$ a partition of $X$. Denote by $T(X)$ the full transformation semigroup on $X$, and $T(X, \mathcal{P})$ the subsemigroup of $T(X)$ consisting of all transformations that…

Rings and Algebras · Mathematics 2023-10-31 Mosarof Sarkar , Shubh N. Singh

Many problems in optimization theory are strongly nonlinear in the traditional sense but possess a hidden linear structure over suitable idempotent semirings. After an overview of `Idempotent Mathematics' with an emphasis on matrix theory,…

Numerical Analysis · Mathematics 2025-10-20 Grigori Litvinov , Andrei Sobolevskii

We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…

Discrete Mathematics · Computer Science 2026-04-10 Antonio E. Porreca , Marius Rolland

The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…

Commutative Algebra · Mathematics 2016-10-05 H. W. Lenstra , A. Silverberg

We study the following problem and its applications: given a homogeneous degree-$d$ polynomial $g$ as an arithmetic circuit, and a $d \times d$ matrix $X$ whose entries are homogeneous linear polynomials, compute $g(\partial/\partial x_1,…

Data Structures and Algorithms · Computer Science 2020-05-12 Cornelius Brand , Kevin Pratt

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to…

Algebraic Geometry · Mathematics 2017-11-15 Simon Telen , Bernard Mourrain , Marc Van Barel

We consider fourth order singularly perturbed eigenvalue problems in one-dimension and the approximation of their solution by the $h$ version of the Finite Element Method (FEM). In particular, we use piecewise Hermite polynomials of degree…

Numerical Analysis · Mathematics 2021-07-15 Hans-Görg Roos , Despo Savvidou , Christos Xenophontos

We consider numerical semigroups associated with normal weighted homogeneous surface singularities with rational homology sphere links. We say that a semigroup is representable if it can be realized in this way. In this article, we study…

Algebraic Geometry · Mathematics 2026-01-21 Zsolt Baja , Tamás László

Let $V$, $\tilde V$ be hypersurface germs in $\CC^m$, each having a quasi-homogeneous isolated singularity at the origin. We show that the biholomorphic equivalence problem for $V$, $\tilde V$ reduces to the linear equivalence problem for…

Complex Variables · Mathematics 2010-07-27 G. Fels , A. Isaev , W. Kaup , N. Kruzhilin

We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…

Computational Complexity · Computer Science 2025-06-05 Chin Ho Lee , Emanuele Viola