Related papers: Parity on based matrices

Pairwise comparison matrices often exhibit inconsistency, therefore many indices have been suggested to measure their deviation from a consistent matrix. A set of axioms has been proposed recently that is required to be satisfied by any…

A. Henrich proved the existence of the universal finite-type invariant of order one for virtual knots. We extend the construction and the methods of her paper to framed virtual knots. To do so, we introduce the notions of virtual strings…

Let $\alpha$ be a map from the set of all knot types ${\mathcal K}$ to a set $X$. Let $\beta$ be a map from ${\mathcal K}$ to a set $Y$. We define the relation between $\alpha$ and $\beta$ to be the image of a map $(\alpha,\beta)$ from…

An equilevel algebra is a subalgebra of the space of smooth functions $f: M \to {\mathbb R}$ distinguished in this space by finitely many linear conditions of the type $f(x_i) = f(\tilde x_i)$, $x_i \neq \tilde x_i \in M$, or approximated…

In this article, we introduce a new object, a virtual quadratic space, and its group of isometries. They are presented as natural generalizations of quadratic spaces and orthogonal groups. It is then shown that by replacing quadratic spaces…

The concept of switching has arisen in several different areas within combinatorics. The act of switching usually transforms a combinatorial object into a non-isomorphic object of the same type, in a way that some key property is preserved.…

Riemann surfaces with nodes can be described by introducing simple composite operators in matrix models. In the case of the Kontsevich model, it is sufficient to add the quadratic, but ``non-propagating'', term (tr[X])^2 to the Lagrangian.…

In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group $G$, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided.…

We consider methods for quantifying the similarity of vertices in networks. We propose a measure of similarity based on the concept that two vertices are similar if their immediate neighbors in the network are themselves similar. This leads…

We establish an algorithm for a criterion of the diagonalisability of a matrix over a local field by a unitary matrix. For this sake, we define the notion of normality of a $p$-adic operator, and give several criteria for the normality. We…

Let $\mathbb{K}$ denote a field and let $\mathfrak{X}$ denote a finite non-empty set. Let $\text{Mat}_\mathfrak{X}(\mathbb{K})$ denote the $\mathbb{K}$-algebra consisting of the matrices with entries in $\mathbb{K}$ and rows and columns…

We show that the change of basis matrices of a set of $m$ bases of a finite vector space is a connected groupoid of order $m^2$. We define a general method to express the elements of change of basis matrices as algebraic expressions using…

For classical knots, there is a concept of (semi)meander diagrams; in this short note we generalize this concept to virtual knots and prove that the classes of meander and semimeander diagrams are universal (this was known for classical…

In a previous paper, we defined an operation $\mu$ that generalizes Turaev's cobracket for loops on a surface. We showed that, in contrast to the cobracket, this operation gives a formula for the minimum number of self-intersections of a…

Random matrix theory is a well-developed area of probability theory that has numerous connections with other areas of mathematics and its applications. Much of the literature in this area is concerned with matrices that possess many exact…

Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…

Let $G$ be a complex, connected, reductive, algebraic group, and $\chi:\mathbb{C}^\times \to G$ be a fixed cocharacter that defines a grading on $\mathfrak{g}$, the Lie algebra of $G$. Let $G_0$ be the centralizer of…

We prove that if R is a principal ideal ring and A\in\M_n(R) is a matrix with trace zero, then A is a commutator, that is, A=XY-YX for some X,Y\in\M_n(R). This generalises the corresponding result over fields due to Albert and Muckenhoupt,…

Regularization has become a primary tool for developing reliable estimators of the covariance matrix in high-dimensional settings. To curb the curse of dimensionality, numerous methods assume that the population covariance (or inverse…

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their…