中文
相关论文

相关论文: Degree bound for toric envelope of a linear algebr…

200 篇论文

For each finite subgroup $G$ of $PGL_2(\mathbb{Q})$, and for each integer $n$ coprime to $6$, we construct explicitly infinitely many Galois extensions of $\mathbb{Q}$ with group $G$ and whose ideal class group has $n$-rank at least…

数论 · 数学 2021-11-05 Jean Gillibert , Pierre Gillibert

There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…

代数几何 · 数学 2024-02-21 Arthur Bik , Jan Draisma , Rob Eggermont , Andrew Snowden

In this paper we introduce a new approach for approximately counting in bounded degree systems with higher-order constraints. Our main result is an algorithm to approximately count the number of solutions to a CNF formula $\Phi$ when the…

数据结构与算法 · 计算机科学 2017-03-17 Ankur Moitra

In this paper we improve the lower bound of Chatterjee et al.\ (ECCC 2019) to an $\Omega(n^2)$ lower bound for unlayered Algebraic Branching Programs. We also study the impact layerization has on Algebraic Branching Programs. We exhibit a…

计算复杂性 · 计算机科学 2020-09-18 Christian Engels

The $\sigma$-irregularity index of a graph is defined as the sum of squared degree differences over all edges and provides a sensitive measure of structural heterogeneity. In this paper, we study the problem of maximizing $\sigma(T)$ among…

组合数学 · 数学 2026-02-17 Milan Bašić

Discovering discrete algebraic rules from data is a fundamental challenge in machine learning. We formalize this problem through Cayley-table completion -- an algebraic counterpart to classical matrix completion -- where the degree of…

机器学习 · 计算机科学 2026-05-21 Dongsung Huh , Lior Horesh , Halyun Jeong

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…

最优化与控制 · 数学 2008-09-09 Jiawang Nie , Kristian Ranestad , Bernd Sturmfels

Let~$E$ be a Hilbertian field of characteristic~$0$. R.W.K. Odoni conjectured that for every positive integer~$n$ there exists a polynomial~$f\in E[X]$ of degree~$n$ such that each iterate~$f^{\circ{k}}$ of~$f$ is irreducible and the Galois…

数论 · 数学 2018-03-13 Joel Specter

We determine the Euclidean distance degree of a projective toric variety. This extends the formula of Matsui and Takeuchi for the degree of the $A$-discriminant in terms of Euler obstructions. Our primary goal is the development of reliable…

代数几何 · 数学 2018-07-23 Martin Helmer , Bernd Sturmfels

We study the inverse problem in the difference Galois theory of linear differential equations over the difference-differential field $\mathbb{C}(x)$ with derivation $\frac{d}{dx}$ and endomorphism $f(x)\mapsto f(x+1)$. Our main result is…

代数几何 · 数学 2020-03-25 Annette Bachmayr , Michael Wibmer

Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…

密码学与安全 · 计算机科学 2026-02-02 Giulia Gaggero , Elisa Gorla

Topologically ordered quantum spin systems have become an area of great interest, as they may provide a fault-tolerant means of quantum computation. One of the simplest examples of such a spin system is Kitaev's toric code. Naaijkens made…

数学物理 · 物理学 2023-11-14 Daniel Wallick

An adjacent vertex distinguishing edge colouring of a graph $G$ without isolated edges is its proper edge colouring such that no pair of adjacent vertices meets the same set of colours in $G$. We show that such colouring can be chosen from…

组合数学 · 数学 2019-01-08 Jakub Kwaśny , Jakub Przybyło

We use techniques from algebraic and extremal combinatorics to derive upper bounds on the number of independent sets in several (hyper)graphs arising from finite geometry. In this way, we obtain asymptotically sharp upper bounds for partial…

组合数学 · 数学 2024-04-09 Sam Mattheus , Geertrui Van de Voorde

Let I be the toric ideal defined by a 2 x n matrix of integers, A = ((1 1 ... 1)(a_1 a_2 ... a_n)) with a_1<a_2<...<a_n. We give a combinatorial proof that I is generated by elements of degree at most the sum of the two largest differences…

交换代数 · 数学 2007-05-23 Hugh Thomas

Let $G$ be a connected algebraic group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. We introduce the notion of the length…

群论 · 数学 2018-05-28 Timothy C. Burness , Martin W. Liebeck , Aner Shalev

An Abelian integral is the integral over the level curves of a Hamiltonian $H$ of an algebraic form $\omega$. The infinitesimal Hilbert sixteenth problem calls for the study of the number of zeros of Abelian integrals in terms of the…

经典分析与常微分方程 · 数学 2020-12-08 Gal Binyamini , Gal Dor

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

代数几何 · 数学 2021-03-09 Niels Lubbes

Good polynomials are the fundamental objects in the Tamo-Barg constructions of Locally Recoverable Codes (LRC). In this paper we classify all good polynomials up to degree $5$, providing explicit bounds on the maximal number $\ell$ of sets…

信息论 · 计算机科学 2021-04-06 Austin Dukes , Andrea Ferraguti , Giacomo Micheli

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

代数几何 · 数学 2024-12-24 Kartoue Mady Demdah , Ibrahim Nonkane