中文
相关论文

相关论文: Strong bi-homogeneous B\'{e}zout theorem and its u…

200 篇论文

We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients. Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems…

符号计算 · 计算机科学 2021-11-30 Guillaume Moroz

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

最优化与控制 · 数学 2019-06-06 Victor Magron , Pierre-Loic Garoche , Didier Henrion , Xavier Thirioux

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…

计算机科学中的逻辑 · 计算机科学 2020-07-21 Andrei A. Bulatov

Let $\sigma_b(X_{m,d}(\mathbb {C}))(\mathbb {R})$, $b(m+1) < \binom{m+d}{m}$, denote the set of all degree $d$ real homogeneous polynomials in $m+1$ variables (i.e. real symmetric tensors of format $(m+1)\times ... \times (m+1)$, $d$ times)…

代数几何 · 数学 2013-07-10 Edoardo Ballico

Let $\R$ be a real closed field, $\mathcal{P},\mathcal{Q} \subset \R[X_1,...,X_k]$ finite subsets of polynomials, with the degrees of the polynomials in $\mathcal{P}$ (resp. $\mathcal{Q}$) bounded by $d$ (resp. $d_0$). Let $V \subset \R^k$…

组合数学 · 数学 2011-11-08 Sal Barone , Saugata Basu

Let $E$ be a semistable elliptic curve over $\mathbb{Q}$. We prove that if $E$ has non-split multiplicative reduction at at least one odd prime or split multiplicative reduction at at least two odd primes and if the rank of $E(\mathbb{Q})$…

数论 · 数学 2014-05-29 Christopher Skinner

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

符号计算 · 计算机科学 2020-09-03 Jean-Charles Faugère , George Labahn , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

In this paper we continue the study of critical sets of solutions $u_\e$ of second-order elliptic equations in divergence form with rapidly oscillating and periodic coefficients. In \cite{Lin-Shen-3d}, by controling the "turning" of…

偏微分方程分析 · 数学 2022-04-07 Fanghua Lin , Zhongwei Shen

Let $\mathbb{K}$ be a field of characteristic zero and $\mathbb{K}[x_1, \dots, x_n]$ the corresponding multivariate polynomial ring. Given a sequence of $s$ polynomials $\mathbf{f} = (f_1, \dots, f_s)$ and a polynomial $\phi$, all in…

符号计算 · 计算机科学 2022-06-13 Thi Xuan Vu

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,…

数据结构与算法 · 计算机科学 2020-05-12 Cornelius Brand , Kevin Pratt

We establish a new class of examples of the multivariate Bateman-Horn conjecture by using tools from dynamics. These cases include the determinant polynomial on the space of $n\times n$ matrices, the Pfaffian on the space of skew-symmetric…

数论 · 数学 2023-12-19 Giorgos Kotsovolis , Katharine Woo

The problem is the classification of the ideals of ``free differential algebras", or the associated quotient algebras, the q-algebras; being finitely generated, unital C-algebras with homogeneous relations and a q-differential structure.…

量子代数 · 数学 2007-05-23 Christian Fronsdal

We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…

符号计算 · 计算机科学 2021-12-22 Huu Phuoc Le , Mohab Safey El Din

This paper is a systematic study of the Hilbert polynomial of a bigraded algebra R which are generated by elements of bidegrees (1,0), (d_1,1),...,(d_r,1), where d_1,...,d_r are non-negative integers. The obtained results can be applied to…

交换代数 · 数学 2007-05-23 Nguyen Duc Hoang , Ngo Viet Trung

For an $n$-element set $X$ let $\binom{X}{k}$ be the collection of all its $k$-subsets. Two families of sets $\mathcal A$ and $\mathcal B$ are called cross-intersecting if $A\cap B \neq \emptyset$ holds for all $A\in\mathcal A$,…

组合数学 · 数学 2019-05-21 Peter Frankl , Andrey Kupavskii

Consider a finite system of non-strict polynomial inequalities with solution set $S\subseteq\mathbb R^n$. Its Lasserre relaxation of degree $d$ is a certain natural linear matrix inequality in the original variables and one additional…

代数几何 · 数学 2018-11-30 Tom-Lukas Kriel , Markus Schweighofer

It is well-known that a connected regular graph is strongly-regular if and only if its adjacency matrix has exactly three eigenvalues. Let $B$ denote an integral square matrix and $\langle B \rangle$ denote the subring of the full matrix…

组合数学 · 数学 2016-08-31 Mitsugu Hirasaka , Semin Oh

We study multivariate monomial Vandermonde matrices $V_N(Z)$ with arbitrary distinct nodes $Z=\{z_1,\dots,z_s\}\subset B_2^n$ in the high-degree regime $N\ge s-1$. Introducing a projection-based geometric statistic -- the \emph{max-min…

经典分析与常微分方程 · 数学 2026-01-21 Omer Friedland , Yosef Yomdin

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

代数几何 · 数学 2023-03-09 Cordian Riener , Robin Schabert

The real radical ideal of a system of polynomials with finitely many complex roots is generated by a system of real polynomials having only real roots and free of multiplicities. It is a central object in computational real algebraic…

最优化与控制 · 数学 2015-04-07 Greg Reid , Fei Wang , Henry Wolkowicz , Wenyuan Wu