English
Related papers

Related papers: On the Removal Lemma for Linear Systems over Abeli…

200 papers

Let K be any field and G be a finite group. We will prove that, if K is any field, p an odd prime number, and G is a non-abelian group of exponent p with |G|=p^3 or p^4 satisfying [K(\zeta_p):K] <= 2, then K(G) is rational over K. We will…

Commutative Algebra · Mathematics 2007-05-23 Ming-chang Kang

There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…

Symbolic Computation · Computer Science 2015-06-09 Sajjad Rahmany , Abdolali Basiri , Benyamin M. -Alizadeh

A central problem of linear algebra is solving linear systems. Regarding linear systems as equations over general semirings (V,otimes,oplus,0,1) instead of rings or fields makes traditional approaches impossible. Earlier work shows that the…

Rings and Algebras · Mathematics 2018-12-17 Hayden Jananthan , Suna Kim , Jeremy Kepner

Within the scope of elementary number theory, we prove that, as the main result, if $1 \leq x < y < z$ are integers such that at least one of $y, z, x+y$ is prime then $x^{n}+y^{n} \neq z^{n}$ for every odd integer $n \geq 3$. This result…

General Mathematics · Mathematics 2020-03-23 Yu-Lin Chou

Let H be a fixed graph with h vertices. The graph removal lemma states that every graph on n vertices with o(n^h) copies of H can be made H-free by removing o(n^2) edges. We give a new proof which avoids Szemer\'edi's regularity lemma and…

Combinatorics · Mathematics 2011-01-04 Jacob Fox

Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…

Symbolic Computation · Computer Science 2018-03-01 Jonathan D. Hauenstein , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

We offer a $\forall\exists$-definition for (affine) Campana points over $\mathbb{P}^1_K$ (where $K$ is a number field), which constitute a set-theoretical filtration between $K$ and $\mathcal{O}_{K,S}$ ($S$-integers), which are well-known…

Number Theory · Mathematics 2025-04-15 Juan Pablo De Rasis

Let $G$ be a group, $m\geq2$ and $n\geq1$. We say that $G$ is an $\mathcal{T}(m,n)$-group if for every $m$ subsets $X_1, X_2, \dots, X_m$ of $G$ of cardinality $n$, there exists $i\neq j$ and $x_i \in X_i, x_j \in X_j$ such that…

Group Theory · Mathematics 2018-01-03 A. Ahmadkhah , S. Marzang , M. Zarrin

In 1985, van den Dries showed that the theory of the reals with a predicate for the integer powers of two admits quantifier elimination in an expanded language, and is hence decidable. He gave a model-theoretic argument, which provides no…

Logic in Computer Science · Computer Science 2007-05-23 Jeremy Avigad , Yimu Yin

We classify cuts in (totally) ordered abelian groups $\g$ and compute the coinitiality and cofinality of all cuts in case $\g$ is divisible, in terms of data intrinsically associated to the invariance group of the cut. We relate cuts with…

Commutative Algebra · Mathematics 2021-09-28 Franz-Viktor Kuhlmann , Enric Nart

Let $q$ be a power of a prime $p$, $G$ be a finite abelian group, where $p$ does not divide $|G|$,and let $n$ be a positive integer. In this paper we find a formula for the number of irreducible representations of $G$ of a given dimension…

Group Theory · Mathematics 2025-04-18 Thomas Breuer , Prashun Kumar , Geetha Venkataraman

Let $K$ be a henselian valued field with ${\cal O}_K$ its valuation ring, $\Gamma$ its value group, and $\boldsymbol{k}$ its residue field. We study the definable subsets of ${\cal O}_K$ and algebraic groups definable over ${\cal O}_K$ in…

Logic · Mathematics 2023-07-13 Chen Ling , Ningyuan Yao

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

Symbolic Computation · Computer Science 2014-09-22 Wei Zhou , George Labahn

We consider discrete linear Chebyshev approximation problems in which the unknown parameters of linear function are fitted by minimizing the maximum absolute deviation of errors. Such problems find application in the solution of…

Optimization and Control · Mathematics 2020-12-22 Nikolai Krivulin

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

Group Theory · Mathematics 2022-05-02 Laura Ciobanu , Albert Garreta

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

Data Structures and Algorithms · Computer Science 2007-05-23 Kevin K. H. Cheung , Michele Mosca

The Gordon--Rodriguez-Villegas theorem says that, in a finite group, the number of solutions to a system of coefficient-free equations is divisible by the order of the group if the rank of the matrix composed of the exponent sums of $j$-th…

Group Theory · Mathematics 2020-06-26 Anton A. Klyachko , Maria A. Ryabtseva

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…

Group Theory · Mathematics 2014-01-21 Michael Giudici , Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl , Pham Huu Tiep

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

Group Theory · Mathematics 2014-02-26 Gustavo A. Fernández-Alcober , Marta Morigi

Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…

K-Theory and Homology · Mathematics 2009-09-03 Ivo Herzog