Related papers: Computational Complexity in Algebraic Combinatoric…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…
Higher homotopies are nowadays playing a prominent role in mathematics as well as in certain branches of theoretical physics. We recall some of the connections between the past and the present developments. Higher homotopies were isolated…
For a finite group G one may consider the associated tower S_n[G] of wreath product groups. Zelevinsky associates to such a tower a positive self-adjoint Hopf algebra (PSH-algebra) R(G) as the infinite direct sum of the Grothendieck groups…
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
Module is effective representation of ring in Abelian group. Linear map of module over commutative ring is morphism of corresponding representation. This definition is the main subject of the book. To consider this definition from more…
Robin Hirsch posed in 1996 the 'Really Big Complexity Problem': classify the computational complexity of the network satisfaction problem for all finite relation algebras A. We provide a complete classification for the case that A is…
The arithmetic complexity counts the number of algebraically independent entries in the periodic continued fraction $\theta=[b_1,\dots, b_N, \overline{a_1,\dots,a_k}]$. If $\mathscr{A}_{\theta}$ is a noncommutative torus corresponding to…
Weihrauch complexity is now an established and active part of mathematical logic. It can be seen as a computability-theoretic approach to classifying the uniform computational content of mathematical problems. This theory has become an…
We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…
We discuss a Clifford algebra framework for discrete symmetry groups (such as reflection, Coxeter, conformal and modular groups), leading to a surprising number of new results. Clifford algebras allow for a particularly simple description…
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank…
We give a non-negative combinatorial formula, in terms of Littlewood-Richardson numbers, for the homology of the unitary representations of the cyclotomic rational Cherednik algebra, and as a consequence, for the graded Betti numbers for…
We survey classical and recent developments in numerical linear algebra, focusing on two issues: computational complexity, or arithmetic costs, and numerical stability, or performance under roundoff error. We present a brief account of the…
This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by…
We show that the strongly symmetric spectral convex compact sets are precisely the normalized state spaces of finite-dimensional simple Euclidean Jordan algebras and the simplices. Spectrality is the property that every state has a convex…
The permutation matrices form a subgroup of $\text{GL}_n(\mathbb{C})$ that is isomorphic to the symmetric group $S_n$. Let $r_{\mu\lambda}$ denote the multiplicity of the irreducible representation $V_\mu$ of $S_n$, corresponding to a…
Quantum Clifford Algebras (QCA), i.e. Clifford Hopf gebras based on bilinear forms of arbitrary symmetry, are treated in a broad sense. Five alternative constructions of QCAs are exhibited. Grade free Hopf gebraic product formulas are…
The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…