English
Related papers

Related papers: A generalized Sylvester-Gallai type theorem for qu…

200 papers

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

Number Theory · Mathematics 2021-09-23 Lucile Devin , Xianchang Meng

Let $P(x)$ be an irreducible quadratic polynomial in $\mathbb{Z}[x]$. We show that for almost all $n$, $P(n)$ does not lie in the range of Euler's totient function.

Number Theory · Mathematics 2018-11-01 Noah Lebowitz-Lockard

We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…

Logic in Computer Science · Computer Science 2020-04-07 Krishnendu Chatterjee , Hongfei Fu , Amir Kafshdar Goharshady , Ehsan Kafshdar Goharshady

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Symbolic Computation · Computer Science 2024-08-29 Yuki Ishihara , Kazuhiro Yokoyama

Let $K$ be a field and let $\mathbb N = \{1,2, \dots \}$. Let $R_n=K[x_{ij} \mid 1\le i\le n, j\in \mathbb N]$ be the ring of polynomials in $x_{ij}$ $(1 \le i \le n, j \in \mathbb N)$ over $K$. Let $S_n = Sym (\{1,2, \ldots, n \})$ and…

Rings and Algebras · Mathematics 2015-09-30 Eudes Antonio da Costa , Alexei Krasilnikov

Let $X=(x_{ij})_{m\times n}$ be a matrix of indeterminates and let $S=\mathbb{k}[x_{ij} \mid 1\leq i\leq m,\ 1\leq j\leq n]$ be a polynomial ring over an infinite field $\mathbb{k}$. Let $I$ be an ideal generated by a subset of the set of…

Commutative Algebra · Mathematics 2026-01-27 Omkar Javadekar

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

Let $R$ be a smooth affine algebra over an infinite perfect field $k$. Let $I\subset R$ be an ideal, $\omega_I:(R/I)^n\to I/I^2$ a surjective homomorphism and $Q_{2n}\subset \mathbb{A}^{2n+1}$ be the smooth quadric defined by the equation…

Commutative Algebra · Mathematics 2017-08-22 Jean Fasel

Let $q = p^s$ be a power of a prime number $p$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. In this paper we obtain the explicit factorization of the cyclotomic polynomial $\Phi_{2^nr}$ over $\mathbb{F}_q$ where both $r…

Number Theory · Mathematics 2011-09-23 Aleksandr Tuxanidy , Qiang Wang

In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…

Classical Analysis and ODEs · Mathematics 2025-07-01 Dan Dai , Mourad E. H. Ismail , Xiang-Sheng Wang

When one expands a Schur function in terms of the irreducible characters of the symplectic (or orthogonal) group, the coefficient of the trivial character is 0 unless the indexing partition has an appropriate form. A number of q-analogues…

Representation Theory · Mathematics 2007-05-23 Eric M. Rains , Monica J. Vazirani

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

Number Theory · Mathematics 2015-01-08 Igor Rivin

We give a deterministic polynomial-time algorithm to check whether the Galois group $\Gal{f}$ of an input polynomial $f(X) \in \Q[X]$ is nilpotent: the running time is polynomial in $\size{f}$. Also, we generalize the Landau-Miller…

Computational Complexity · Computer Science 2007-05-23 V. Arvind , Piyush P Kurur

We classify the irredible representations of $\mathrm{GL}_{2}(q)$ for which the induction to the product group $\mathrm{GL}_{2}(q)\times\mathrm{GL}_{2}(q)$, under the diagonal embedding, decomposes multiplicity free. It turns out that only…

Representation Theory · Mathematics 2025-07-16 Elias Depuydt , Maarten van Pruijssen

We analyze the structure of the family of quadratic superalgebras, introduced in J Phys A 44(23):235205 (2011), for the quadatic deformations of $N = 1$ space-time conformal supersymmetry. We characterize in particular the `zero-step'…

High Energy Physics - Theory · Physics 2018-04-04 L. A. Yates , P. D. Jarvis

Let $S$ be a dense subring of the real numbers. In this paper we prove a polynomial version of Van der Waerden's theorem near zero. In fact, we prove that if $p_1,\ldots,p_m \in \mathbb{Z}[x]$ are polynomials such that $p_i(0) = 0$ and…

Combinatorics · Mathematics 2025-08-13 Ghadir Ghadimi , Mohammad Akbari Tootkaboni

We develop a theory of two-parameter quantum polynomial functors. Similar to how (strict) polynomial functors give a new interpretation of polynomial representations of the general linear groups $\operatorname{GL}_n$, the two-parameter…

Representation Theory · Mathematics 2020-01-24 Valentin Buciumas , Hankyung Ko

Let $Q_{p,q}(t)\in\mathbb{Z}[t]$ be Sharipov's even monic degree-$10$ second cuboid polynomial depending on coprime integers $p\neq q>0$. Writing $Q_{p,q}(t)$ as a quintic in $t^{2}$ produces an associated monic quintic polynomial. After…

General Mathematics · Mathematics 2026-01-23 Valery Asiryan , Randall L. Rathbun

In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers $\mathbb{Q}_p$. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we…

Number Theory · Mathematics 2022-01-31 Nadir Murru , Giuliano Romeo , Giordano Santilli

This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…

Computational Complexity · Computer Science 2010-07-19 Zhixiang Chen , Bin Fu , Yang Liu , Robert Schweller