中文
相关论文

相关论文: Arithmetic Multivariate Descartes' Rule

200 篇论文

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…

数论 · 数学 2023-02-15 Benjamin Matschke , Abhijit S. Mudigonda

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

符号计算 · 计算机科学 2025-05-01 Thi Xuan Vu

We present an optimal version of Descartes' rule of signs to bound the number of positive real roots of a sparse system of polynomial equations in n variables with n+2 monomials. This sharp upper bound is given in terms of the sign…

代数几何 · 数学 2022-05-27 Frédéric Bihan , Alicia Dickenstein , Jens Forsgård

Let f(x) = f(x_1, ..., x_n) = \sum_{|S| <= k} a_S \prod_{i \in S} x_i be an n-variate real multilinear polynomial of degree at most k, where S \subseteq [n] = {1, 2, ..., n}. For its "one-block decoupled" version, f~(y,z) = \sum_{|S| <= k}…

离散数学 · 计算机科学 2015-12-08 Ryan O'Donnell , Yu Zhao

We give partial generalizations of the classical Descartes' rule of signs to multivariate polynomials (with real exponents), in the sense that we provide upper bounds on the number of connected components of the complement of a hypersurface…

代数几何 · 数学 2022-07-07 Elisenda Feliu , Máté L. Telek

Let $ \mathcal{A}_1, \ldots, \mathcal{A}_k $ be finite sets in $ \mathbb{Z}^n $ and let $ Y \subset (\mathbb{C}^*)^n $ be an algebraic variety defined by a system of equations \[ f_1 = \ldots = f_k = 0, \] where $ f_1, \ldots, f_k $ are…

代数几何 · 数学 2018-10-02 Leonid Monin

Given polynomials $f_1,\ldots,f_n$ in $m$ variables with integral coefficients, we give upper bounds for the number of integral $m$-tuples $\mathbf{u}_1,\ldots, \mathbf{u}_n$ of bounded height such that $f_1(\mathbf{u}_1), \ldots,…

数论 · 数学 2024-02-22 Marley Young

Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…

组合数学 · 数学 2016-08-25 J. Gordon , F. Petrov

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

代数几何 · 数学 2013-10-22 Abdallah Assi

Let L be the Lie algebra of a simple algebraic group defined over a field F and let H be a split Cartan subalgebra of L. Then L has a Chevalley basis with respect to H. If the characteristic of F is not 2 or 3, it is known how to find it.…

环与代数 · 数学 2011-06-17 Arjeh M. Cohen , Dan A. Roozemond

We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…

表示论 · 数学 2021-08-04 Jiarui Fei

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

数论 · 数学 2025-06-23 Luca Bastioni , Giacomo Micheli , Shujun Zhao

We show that the sequence of moduli of the eigenvalues of a matrix polynomial is log-majorized, up to universal constants, by a sequence of "tropical roots" depending only on the norms of the matrix coefficients. These tropical roots are…

谱理论 · 数学 2017-01-03 Marianne Akian , Stephane Gaubert , Meisam Sharify

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

数论 · 数学 2022-10-11 Jean Kieffer

The present paper considers extremal combinatorics questions in the language of matrices. An $s$-matrix is a matrix with entries in $\{0,1,\ldots, s-1\}$. An $s$-matrix is simple if it has no repeated columns. A matrix $F$ is a…

组合数学 · 数学 2025-02-10 Wallace Peaslee , Attila Sali , Jun Yan

The independence polynomial of a graph $G$ is \[I(G,x)=\sum\limits_{k\ge 0}i_k(G)x^k,\] where $i_k(G)$ denotes the number of independent sets of $G$ of size $k$ (note that $i_0(G)=1$). In this paper we show a new method to prove…

组合数学 · 数学 2017-03-17 Ferenc Bencs

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

代数几何 · 数学 2016-09-06 J. Maurice Rojas

Let $K$ be an arbitrary field of characteristic zero, $P_n:= K[ x_1, ..., x_n]$ be a polynomial algebra, and $P_{n, x_1}:= K[x_1^{-1}, x_1, ..., x_n]$, for $n\geq 2$. Let $\s' \in {\rm Aut}_K(P_n)$ be given by $$ x_1\mapsto x_1-1, \quad…

环与代数 · 数学 2007-05-23 V V Bavula , T H Lenagan

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

数论 · 数学 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

We consider the class of all homogeneous, possibly non-reduced, polynomials $f$ whose associated reduced projective divisor $D_{\text{red}} \subset \mathbb{P}^{n-1}$ has (at worst) quasi-homogeneous isolated singularities. In an arbitrary…

代数几何 · 数学 2026-02-25 Daniel Bath , Willem Veys