Related papers: Interactions Between Brauer Configuration Algebras…
Formal mathematics and computer science proofs are formalized using Hilbert-Russell-style logical systems which are designed to not admit paradoxes and self-refencing reasoning. These logical systems are natural way to describe and reason…
Regularized generalized canonical correlation analysis (RGCCA) is a generalization of regularized canonical correlation analysis to three or more sets of variables, which is a component-based approach aiming to study the relationships…
With distributed computing and mobile applications, synchronizing diverging replicas of data structures is a more and more common problem. We use algebraic methods to reason about filesystem operations, and introduce a simplified definition…
Canonical correlation analysis (CCA) is a classical representation learning technique for finding correlated variables in multi-view data. Several nonlinear extensions of the original linear CCA have been proposed, including kernel and deep…
In a recent paper Cohen, Liu and Yu introduce the Type $C$ Brauer algebra. We show that this algebra is an iterated inflation of hyperoctahedral groups, and that it is cellularly stratified. This gives an indexing set of the standard…
Biserial algebras are a classical class in the representation theory of algebras, generalizing Nakayama algebras. They were further generalized by Green and Schroll to multiserial algebras, which share many structural properties with…
The individualization-refinement paradigm for computing a canonical labeling and the automorphism group of a graph is investigated. A new algorithmic design aimed at reducing the size of the associated search space is introduced, and a new…
We give a classical confidence belt construction which unifies the treatment of upper confidence limits for null results and two-sided confidence intervals for non-null results. The unified treatment solves a problem (apparently not…
We determine conditions on classical group algebra codes so that they have pre-orientation for cup products and copy-cup gates. This defines quantum codes that have constant-depth $\operatorname{CZ}$ and $\operatorname{CCZ}$ gates…
Quantum algorithms have demonstrated promising speed-ups over classical algorithms in the context of computational learning theory - despite the presence of noise. In this work, we give an overview of recent quantum speed-ups, revisit the…
We find a canonical $N{=}2$ superconformal algebra (SCA) in the BRST complex associated to any affine Lie algebra $\hat{\mathbf{h}}$ with $\mathbf{h}$ semisimple. In contrast with the similar known results for the Virasoro, $N{=}1$…
Quantum baker`s map is a model of chaotic system. We study quantum dynamics for the quantum baker's map. We use the Schack and Caves symbolic description of the quantum baker`s map. We find an exact expression for the expectation value of…
Large-scale quantum computing is a significant threat to classical public-key cryptography. In strong "quantum access" security models, numerous symmetric-key cryptosystems are also vulnerable. We consider classical encryption in a model…
Cadences are complex structures that have been driving music from the beginning of contrapuntal polyphony until today. Detecting such structures is vital for numerous MIR tasks such as musicological analysis, key detection, or music…
We survey results on multiserial algebras, special multiserial algebras and Brauer configuration algebras. A structural property of modules over a special multiserial algebra is presented. Almost gentle algebras are introduced and we…
In this review article, first we give the concrete formulas of representations and cohomologies of associative algebras, Lie algebras, pre-Lie algebras, Leibniz algebras and 3-Lie algebras and some of their strong homotopy analogues. Then…
The sum-of-correlations (SUMCOR) formulation of generalized canonical correlation analysis (GCCA) seeks highly correlated low-dimensional representations of different views via maximizing pairwise latent similarity of the views. SUMCOR is…
Anshel, Anshel, Goldfeld and Lemieaux introduced the Colored Burau Key Agreement Protocol (CBKAP) as the concrete instantiation of their Algebraic Eraser scheme. This scheme, based on techniques from permutation groups, matrix groups and…
The application of synchronization theory to build up new cryptosystems has been a hot topic during the last two decades. In this paper we analyze a recent proposal in this field. We pinpoint the main limitations of the software…
This paper presents a quantum search approach to combinatorial constraint satisfaction problems, demonstrated through the generation of magic squares. We reformulate magic square construction as a quantum search problem in which a…