English
Related papers

Related papers: Hyperpfaffians and Geometric Complexity Theory

200 papers

Tensor product function (TPF) approximations have been widely adopted in solving high-dimensional problems, such as partial differential equations and eigenvalue problems, achieving desirable accuracy with computational overhead that scales…

Numerical Analysis · Mathematics 2026-04-17 Yuyang Wang , Yukuan Hu , Xin Liu

Quantum knot invariants (like colored HOMFLY-PT or Kauffman polynomials) are a distinguished class of non-perturbative topological invariants. Any known way to construct them (via Chern-Simons theory or quantum R-matrix) starts with a…

High Energy Physics - Theory · Physics 2025-06-12 Dmitry Khudoteplov , Alexei Morozov , Alexey Sleptsov

Let G be a finite p-subgroup of GL(V), where p = char(F), and V is finite-dimensional over the field F. Let S(V) be the symmetric algebra of V, S(V)^G the subring of G-invariants, and V* the F-dual space of V. The following presents our…

Commutative Algebra · Mathematics 2020-11-26 Amiram Braun

The main theorem of this paper asserts that the inclusion of the space of projective Lagrangian planes into the space of Lagrangian submanifolds of complex projective space induces an injective homomorphism of fundamental groups. We…

Symplectic Geometry · Mathematics 2007-05-23 Meike Akveld , Dietmar Salamon

This is an expanded version of the text ``Perverse Sheaves on Loop Grassmannians and Langlands Duality'', AG/9703010. The main new result is a topological realization of algebraic representations of reductive groups over arbitrary rings. We…

Algebraic Geometry · Mathematics 2007-05-23 I. Mirković , K. Vilonen

This is the third revision. We study bases of Pfaffian systems for $A$-hypergeometric system. Gr\"obner deformations give bases. These bases also give those for twisted cohomology groups. For hypergeometric system associated to a class of…

Classical Analysis and ODEs · Mathematics 2014-06-19 Takayuki Hibi , Kenta Nishiyama , Nobuki Takayama

The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…

Computational Complexity · Computer Science 2025-02-04 Prerona Chatterjee , Mrinal Kumar , C Ramya , Ramprasad Saptharishi , Anamay Tengse

In the previous paper (J. Combin. Theory Ser. A, 120, 2013, 1263--1284) H. Tagawa and the two authors proposed an algebraic method to compute certain Pfaffians whose form resemble to Hankel determinants associated with moment sequences of…

Combinatorics · Mathematics 2022-10-21 Masao Ishikawa , Jiang Zeng

Given a hypersurface defined by $f$ in a smooth complex algebraic variety $X$, and a point $P$ on this hypersurface, we consider the invariant $\beta_P(f)$ given by the log canonical threshold at $P$ of ${\mathfrak m}_P\cdot J_f$, where…

Algebraic Geometry · Mathematics 2026-03-17 Mircea Mustaţă

Ideals generated by pfaffians are of interest in commutative algebra and algebraic geometry, as well as in combinatorics. In this article we compute multiplicity and Castelnuovo-Mumford regularity of pfaffian ideals of ladders. We give…

Commutative Algebra · Mathematics 2013-03-28 Emanuela De Negri , Elisa Gorla

A fully tensorial theoretical framework for hypercomplex-valued neural networks is presented. The proposed approach enables neural network architectures to operate on data defined over arbitrary finite-dimensional algebras. The central…

Machine Learning · Computer Science 2026-01-27 Agnieszka Niemczynowicz , Radosław Antoni Kycia

Around 1967, Arveson invented a striking noncommutative generalization of classical $H^\infty$, known as {\em subdiagonal algebras}, which include a wide array of examples of interest to operator theorists. Their theory extends that of the…

Operator Algebras · Mathematics 2016-09-07 David P. Blecher , Louis E. Labuschagne

The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…

Numerical Analysis · Computer Science 2012-11-22 Akitoshi Kawamura , Norbert Th. Müller , Carsten Rösnick , Martin Ziegler

We present results expressing conditions for the existence of meromorphic first integrals for Pfaff equations of arbitrary codimension, integrable or not, on complex manifolds. These results are in the same vein as previous ones by J-P.…

Algebraic Geometry · Mathematics 2018-10-15 Maurício Corrêa , Luis G. Maza , Marcio G. Soares

We show that the shortest nonzero polynomials vanishing on bounded-rank matrices and skew-symmetric matrices are the determinants and Pfaffians characterising the rank. Algebraically, this means that in the ideal generated by all $t$-minors…

Commutative Algebra · Mathematics 2023-03-01 Jan Draisma , Thomas Kahle , Finn Wiersig

In arXiv:1711.10132 a new approximating invariant ${\mathsf{TC}}^{\mathcal{D}}$ for topological complexity was introduced called $\mathcal{D}$-topological complexity. In this paper, we explore more fully the properties of…

Algebraic Topology · Mathematics 2018-07-12 Michael Farber , Mark Grant , Gregory Lupton , John Oprea

This Paper defines and explores solution to the problem of \emph{Inversion of a finite Sequence} over the binary field, that of finding a prefix element of the sequence which confirms with a \emph{Recurrence Relation} (RR) rule defined by a…

Cryptography and Security · Computer Science 2024-07-01 Virendra Sule

In our previous work, a unified description as polynomial Hamiltonian systems was established for a broad class of the Schlesinger systems including the sixth Painleve equation and Garnier systems. The main purpose of this paper is to…

Classical Analysis and ODEs · Mathematics 2010-09-15 Teruhisa Tsuda

Yuzvinsky and Rose-Terao have shown that the homological dimension of the gradient ideal of the defining polynomial of a generic hyperplane arrangement is maximum possible. In this work one provides yet another proof of this result, which…

Commutative Algebra · Mathematics 2024-08-27 Ricardo Burity , Zaqueu Ramos , Aron Simis , Stefan Tohaneanu

The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…

Computational Complexity · Computer Science 2015-04-02 Akihiro Yabe