Related papers: A universal theory of switching for combinatorial …
Kendall transformation is a conversion of an ordered feature into a vector of pairwise order relations between individual values. This way, it preserves ranking of observations and represents it in a categorical form. Such transformation…
A mixed multigraph is obtained from an undirected multigraph by orienting a subset of its edges. In this paper, we study a new Hermitian matrix representation of mixed multigraphs, give an introduction to cospectral operations on mixed…
We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…
Spectral hypergraph theory studies the structural properties of a hypergraph that can be inferred from the eigenvalues and the eigenvectors of either matrices or tensors associated with it. In this paper we study the spectral…
The generic transition in the boson Hubbard model, occurring at an incommensurate chemical potential, is studied in the link-current representation using the recently developed directed geometrical worm algorithm. We find clear evidence for…
The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have…
The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…
This article represents a major step in the unification of the theory of algebraic, topological and singular transition matrices by introducing a definition which is a generalization that encompasses all of the previous three. When this…
We introduce the notion of combinatorial gauge symmetry -- a local transformation that includes single spin rotations plus permutations of spins (or swaps of their quantum states) -- that preserve the commutation and anti-commutation…
Hadamard's global inverse theorem provides conditions for a function to be globally invertible on Rn. In this note we show that the conditions are robust enough for the conclusion to hold even if we relax the conditions by removing the…
Extending a theorem of Whitney of 1931 we prove that all connected d-graphs are Hamiltonian for positive d. A d-graph is a type of combinatorial manifold which is inductively defined as a finite simple graph for which every unit sphere is a…
We introduce a transfer matrix method for the spectral analysis of discrete Hermitian operators with locally finite hopping. Such operators can be associated with a locally finite graph structure and the method works in principle on any…
The universal invariant with respect to a given ribbon Hopf algebra is a tangle invariant that dominates all the Reshetikhin-Turaev invariants built from the representation theory of the algebra. We construct a canonical strict monoidal…
Hadamard matrices are $(-1, +1)$ square matrices with mutually orthogonal rows. The Hadamard conjecture states that Hadamard matrices of order $n$ exist whenever $n$ is $1$, $2$, or a multiple of $4$. However, no construction is known that…
A necklace is an equivalence class of words of length $n$ over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic results for key operations on necklaces, including counting,…
Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…
The Hadamard quasigroup product has recently been introduced as a natural generalization of the classical Hadamard product of matrices. It is defined as the superposition operator of three binary operations, one of them being a quasigroup…
Recent studies of the topological properties of a general class of lattice Dirac operators are reported. This is based on a specific algebraic realization of the Ginsparg-Wilson relation in the form…
We establish a fixed point theorem for mappings of square matrices of all sizes which respect the matrix sizes and direct sums of matrices. The conclusions are stronger if such a mapping also respects matrix similarities, i.e., is a…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…