中文
相关论文

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

200 篇论文

We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…

复变函数 · 数学 2021-01-12 Anthony Stefan , Aaron Welters

In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson's identity in number theory. Finally, we obtain a…

历史与综述 · 数学 2022-05-10 Mortaza Bayat , Hossein Teimoori Faal

We show that the decidability of an amplification of Hilbert's Tenth Problem in three variables implies the existence of uncomputably large integral points on certain algebraic curves. We obtain this as a corollary of a new positive…

数论 · 数学 2007-05-23 J. Maurice Rojas

A multilateral Bailey Lemma is proved, and multiple analogues of the Rogers--Ramanujan identities and Euler's Pentagonal Theorem are constructed as applications. The extreme cases of the Andrews--Gordon identities are also generalized using…

组合数学 · 数学 2010-02-02 Hasan Coskun

For an nxn matrix A over a Lie nilpotent ring R of index k, we prove that an invariant "power" Cayley-Hamilton identity of degree (n^2)2^{k-2} holds. The right coefficients are not uniquely determined by A, and the cosets lambda_i+D, with D…

环与代数 · 数学 2019-09-24 Jeno Szigeti , Szilvia Szilagyi , Leon van Wyk

In 1970 Vaughan-Lee established that over an infinite field of characteristic two the ideal T[gl(2)] of all polynomial identities for the Lie algebra gl(2) is not finitely generated as a T-ideal. But a generating set for this ideal of…

环与代数 · 数学 2016-12-23 Artem Lopatin

Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also give applications and connections to polynomial identity…

计算复杂性 · 计算机科学 2009-07-24 V. Arvind , Pushkar S. Joglekar , Srikanth Srinivasan

Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…

计算复杂性 · 计算机科学 2007-05-23 Jean-Luc Brylinski , Ranee Brylinski

An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…

数论 · 数学 2015-05-13 Graham Everest , Patrick Ingram , Valery Mahe , Shaun Stevens

We evaluate a curious determinant, first mentioned by George Andrews in 1980 in the context of descending plane partitions. Our strategy is to combine the famous Desnanot-Jacobi-Dodgson identity with automated proof techniques. More…

组合数学 · 数学 2019-04-09 Christoph Koutschan , Thotsaporn Thanatipanonda

Let C be a uniform clutter, i.e., all the edges of C have the same size, and let A be the incidence matrix of C. We denote the column vectors of A by v1,...,vq. The vertex covering number of C, denoted by g, is the smallest number of…

交换代数 · 数学 2011-04-05 Luis A. Dupont , Rafael H. Villarreal

This paper presents both a proof method and a result. The proof method presented is particularly suitable for uniformly proving families of identities satisfied by a family of recursive sequences. To illustrate the method, we study the…

组合数学 · 数学 2021-07-09 Russell Jay Hendel

We introduce two-sorted theories in the style of [CN10] for the complexity classes \oplusL and DET, whose complete problems include determinants over Z2 and Z, respectively. We then describe interpretations of Soltys' linear algebra theory…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Stephen A Cook , Lila A Fontes

A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…

计算复杂性 · 计算机科学 2007-08-28 Vadim Tarin

In investigating the properties of a certain class of homogeneous polynomials, we discovered an identity satisfied by their coefficients which involves simple 2F1 Gauss hypergeometric functions. This result appears to be new and we supply a…

经典分析与常微分方程 · 数学 2009-06-05 Philip W. Livermore , Glenn R. Ierley

We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…

计算机科学中的逻辑 · 计算机科学 2025-09-30 Jonas Bayer , Marco David

Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…

计算机科学中的逻辑 · 计算机科学 2026-05-14 Neta Elad , Sharon Shoham

We prove a few uniform versions of the Mordell-Lang Conjecture and of the Shafarevich Conjecture for curves over function fields and their rational points. The main focus is on function fields having high transcendence degree over the…

代数几何 · 数学 2007-05-23 Lucia Caporaso

We introduce a new approach to the classification of operator identities, based on basic concepts from the theory of algebraic operads together with computational commutative algebra applied to determinantal ideals of matrices over…

环与代数 · 数学 2025-08-01 Murray R. Bremner , Hader A. Elgendy

We formalize a framework of algebraically natural lower bounds for algebraic circuits. Just as with the natural proofs notion of Razborov and Rudich for boolean circuit lower bounds, our notion of algebraically natural lower bounds captures…

计算复杂性 · 计算机科学 2018-07-24 Michael A. Forbes , Amir Shpilka , Ben Lee Volk