Related papers: A note on $\alpha$-permanent and loop soup
We show that the permanent of a matrix is a linear combination of determinants of block diagonal matrices which are simple functions of the original matrix. To prove this, we first show a more general identity involving \alpha-permanents:…
We recall Vere-Jones's definition of the $\alpha$--permanent and describe the connection between the (1/2)--permanent and the hafnian. We establish expansion formulae for the $\alpha$--permanent in terms of partitions of the index set, and…
Persistent homology was shown by Carlsson and Zomorodian to be homology of graded chain complexes with coefficients in the graded ring $\kk[t]$. As such, the behavior of persistence modules -- graded modules over $\kk[t]$ is an important…
We review and update on a few conjectures concerning matrix permanent that are easily stated, understood, and accessible to general math audience. They are: Soules permanent-on-top conjecture${}^\dagger$, Lieb permanent dominance…
This paper lays the foundations of triangulated persistence categories (TPC), which brings together persistence modules with the theory of triangulated categories. As a result we introduce several measurements and metrics on the set of…
We consider sequences of absolute and relative homology and cohomology groups that arise naturally for a filtered cell complex. We establish algebraic relationships between their persistence modules, and show that they contain equivalent…
We establish an analogue of the fundamental theorem of algebra for polynomial matrix equations, in which the matrices-coefficients and unknown matrix are assumed to be circulant matrices.
Algebraic dichotomy is a generalization of an exponential dichotomy (Lin, JDE2009). This paper gives a version of Hartman-Grobman linearization theorem assuming that linear system admits an algebraic dichotomy, which generalizes the…
We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…
We show that any matrix-polynomial combination of free noncommutative random variables each having an algebraic law has again an algebraic law. Our result answers a question raised by a recent paper of Shlyakhtenko and Skoufranis. The…
The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…
A multiplication on persistence diagrams is introduced by means of Schubert calculus. The key observation behind this multiplication comes from the fact that the representation space of persistence modules has the structure of the Schubert…
We discuss the algebra behind the matrix reduction algorithm for persistent homology, as presented in the paper ''Computing Persistent Homology'' by Afra Zomorodian and Gunnar Carlsson, in the lens of the more modern characterization of…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
In this paper, we establish an analogue of the Fundamental Theorem of Algebra for polynomial matrix equations, where both the coefficient matrices and the unknown matrix are $Q$-circulant matrices. This result generalizes Abramov's result…
We study new classes of linear preservers between C$^*$-algebras and JB$^*$-triples. Let $E$ and $F$ be JB$^*$-triples with $\partial_{e} (E_1)$. We prove that every linear map $T:E\to F$ strongly preserving Brown-Pedersen quasi-invertible…
We prove a probabilistic Fourier extension theorem that says Fourier extension holds when averaged over certain smooth Alpert multipliers. The proofs use smooth Alpert wavelets with the classical techniques of stationary phase and…
We expand the toolbox of (co)homological methods in computational topology by applying the concept of persistence to sheaf cohomology. Since sheaves (of modules) combine topological information with algebraic information, they allow for…
Descent polynomials and peak polynomials, which enumerate permutations with given descent and peak sets respectively, have recently received considerable attention. We give several formulas for $q$-analogs of these polynomials which refine…
A vertex of a randomly growing graph is called a persistent hub if at all but finitely many moments of time it has the maximal degree in the graph. We establish the existence of a persistent hub in the Barab\'asi--Albert random graph model…