中文
相关论文

相关论文: Uniform, Integral and Feasible Proofs for the Dete…

200 篇论文

The G\"ollnitz-Gordon-Andrews identities generalize the partition identities discovered independently by H. G\"ollnitz and B. Gordon. In this article, we present a commutative algebra proof of the G\"ollnitz-Gordon-Andrews identities. More…

组合数学 · 数学 2026-04-24 Rupam Barman , Alapan Ghosh , Gurinder Singh

We prove an interesting identity for the sum of determinants, which is a generalization of the sum of a geometric progression. The proof is quite long and a number of other identities are proved along the way. Some of the more elementary…

组合数学 · 数学 2024-08-28 T. C. Dorlas

In (Kabanets, Impagliazzo, 2004) it is shown how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial family for arithmetical…

计算复杂性 · 计算机科学 2009-10-09 Maurice Jansen

In the long paper "Family Blowup formula, Admissible Graphs and the Enumeration of Singular Curves (I)" (appearing in JDG), the author solved the enumeration problem of nodal (or general singular) curve counting on algebraic surfaces by…

代数几何 · 数学 2007-05-23 Ai-Ko Liu

We determine minimal Cayley--Hamilton and Capelli identities for matrices over a Grassmann algebra of finite rank. For minimal standard identities, we give lower and upper bounds on the degree. These results improve on upper bounds given by…

环与代数 · 数学 2016-05-11 Péter E. Frenkel

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be…

环与代数 · 数学 2023-11-20 Clemens G. Raab , Georg Regensburger , Jamal Hossein Poor

This note concerns a one-line diagrammatic proof of the Cayley-Hamilton Theorem. We discuss the proof's implications regarding the "core truth" of the theorem, and provide a generalization. We review the notation of trace diagrams and…

环与代数 · 数学 2009-07-15 Elisha Peterson

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

数论 · 数学 2018-07-09 Fusun Akman

We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…

环与代数 · 数学 2022-03-08 Jason P. Bell , Peter V. Danchev

The variety of principal minors of $n\times n$ symmetric matrices, denoted $Z_{n}$, is invariant under the action of a group $G\subset \GL(2^{n})$ isomorphic to $\G$. We describe an irreducible $G$-module of degree $4$ polynomials…

代数几何 · 数学 2011-08-25 Luke Oeding

The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…

组合数学 · 数学 2025-11-11 Sudip Bera

Let $A$ be an $n\times n$ real Toeplitz matrix satisfying $A+A^{\top}=2\mathbb J_n$, where $\mathbb J_n$ is the all-ones matrix.If $A_r(i,j)$ denotes the $r\times r$ contiguous submatrix of $A$ consisting of rows $i,i+1,\dots,i+r-1$ and…

泛函分析 · 数学 2026-01-28 Teng Zhang

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

群论 · 数学 2016-08-16 Emmanuel Breuillard , Matthew Tointon

Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact,…

交换代数 · 数学 2019-05-14 Daniel Erman , Steven V Sam , Andrew Snowden

Here we consider the image of the principal minor map of symmetric matrices over an arbitrary unique factorization domain $R$. By exploiting a connection with symmetric determinantal representations, we characterize the image of the…

代数几何 · 数学 2021-05-31 Abeer Al Ahmadieh , Cynthia Vinzant

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Erich Grädel , Martin Grohe , Benedikt Pago , Wied Pakusa

This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…

离散数学 · 计算机科学 2025-07-28 David Russinoff

We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…

环与代数 · 数学 2017-01-09 Dušan D. Repovš , Mikhail V. Zaicev

We show that CC-circuits of bounded depth have the same expressive power as circuits over finite nilpotent algebras from congruence modular varieties. We use this result to phrase and discuss a new algebraic version of Barrington, Straubing…

环与代数 · 数学 2023-06-22 Michael Kompatscher

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…

计算机科学中的逻辑 · 计算机科学 2018-10-11 Ruben Gamboa , John Cowles