Related papers: Decomplexification of the Capelli identities and h…
There has been growing interest in recent years in Q-matrix based cognitive diagnosis models. Parameter estimation and respondent classification under these models may suffer due to identifiability issues. Non-identifiability can be…
Factorization of the differential expansion coefficients for HOMFLY-PT polynomials of double braids, discovered in arXiv:1606.06015 in the case of rectangular representations $R$, is extended to the first non-rectangular representations…
Not all people are equally easy to identify: color statistics might be enough for some cases while others might require careful reasoning about high- and low-level details. However, prevailing person re-identification(re-ID) methods use…
Face Recognition is most used for biometric user authentication that identifies a user based on his or her facial features. The system is in high demand, as it is used by many businesses and employed in many devices such as smartphones and…
In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an…
In this paper, we interpret disentanglement as the discovery of local charts of the data manifold and trace how this definition naturally leads to an equivalent condition for disentanglement: commutativity between factors of variation. We…
We use F. Ferrari's methods relating matrix models to Calabi-Yau spaces in order to explain much of Intriligator and Wecht's ADE classification of $\N=1$ superconformal theories which arise as RG fixed points of $\N = 1$ SQCD theories with…
A face morph is created by strategically combining two or more face images corresponding to multiple identities. The intention is for the morphed image to match with multiple identities. Current morph attack detection strategies can detect…
This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…
We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…
This paper is an exploration in a functional programming framework of {\em isomorphisms} between elementary data types (natural numbers, sets, multisets, finite functions, permutations binary decision diagrams, graphs, hypergraphs,…
Documents revealing sensitive information about individuals must typically be de-identified. This de-identification is often done by masking all mentions of personally identifiable information (PII), thereby making it more difficult to…
We introduce right eigenvalues and subeigenvalues for square dual complex matrices. An $n \times n$ dual complex Hermitian matrix has exactly $n$ right eigenvalues and subeigenvalues, which are all real. The Hermitian matrix is positive…
This work developed novel complex matrix factorization methods for face recognition; the methods were complex matrix factorization (CMF), sparse complex matrix factorization (SpaCMF), and graph complex matrix factorization (GraCMF). After…
In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix.…
The well-known formula $det(A\cdot B)=\det A \cdot \det B$ can be easily proved for finite dimensional matrices but it may be incorrect for the functional determinants of differential operators, including the ones which are relevant for…
In the framework of the Drinfeld theory of twists in Hopf algebras we construct quantum matrix algebras which generalize the Reflection Equation and the RTT algebras. Finite-dimensional representations of these algebras related to the…
We study the geometry of determinantal point processes (DPPs) through the spectral decomposition $L=U\Lambda U^{\top}$. The spectrum $\Lambda$ governs the cardinality distribution via elementary symmetric polynomials, while the eigenspace…
Lambda-calculi come with no fixed evaluation strategy. Different strategies may then be considered, and it is important that they satisfy some abstract rewriting property, such as factorization or normalization theorems. In this paper we…
In this papier, by the classical umbral calculus method, we establish identities involving the Appell polynomials and extend some existing identities.