Related papers: A universal theory of switching for combinatorial …
We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g=0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field, each with K rows,…
Hashing plays an important role in information retrieval, due to its low storage and high speed of processing. Among the techniques available in the literature, multi-modal hashing, which can encode heterogeneous multi-modal features into…
We introduce the category of optiongraphs and option-preserving maps as a model to study impartial combinatorial games. Outcomes, remoteness, and extended nim-values are preserved under option-preserving maps. We show that the four…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
Interest in combinatorial interpretations of mathematical entities stems from the convenience of the concrete models they provide. Finding a bijective proof of a seemingly obscure identity can reveal unsuspected significance to it. Finding…
The spectral properties of interacting strongly chaotic systems are investigated for growing interaction strength. A very sensitive transition from Poisson statistics to that of random matrix theory is found. We introduce a new random…
The switching model is a Markov chain approach to sample graphs with fixed degree sequence uniformly at random. The recently invented Curveball algorithm for bipartite graphs applies several switches simultaneously (`trades'). Here, we…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
We apply Godsil-McKay switching to the symplectic graphs over $\mathbb{F}_2$ with at least 63 vertices and prove that the 2-rank of (the adjacency matrix of) the graph increases after switching. This shows that the switched graph is a new…
Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by…
Given a family of systems, identifying stabilizing switching signals in terms of infinite walks constructed by concatenating cycles on the underlying directed graph of a switched system that satisfy certain conditions, is a well-known…
A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via…
Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…
The notion of unbiased orthogonal designs is introduced as a generalization among unbiased Hadamard matrices, unbiased weighing matrices and quasi-unbiased weighing matrices. We provide upper bounds and several constructions for mutually…
We describe combinatorial properties of the defining row of a circulant Hadamard matrix by exploiting its orthogonality to subsequent rows, and show how to exclude several particular forms of these matrices.
This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…
A Hadamard matrix is a scaled orthogonal matrix with $\pm 1$ entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when $n$ is a multiple of 4. A conjecture attributed to Ryser is…
Universality in unitary invariant random matrix ensembles with complex matrix elements is considered. We treat two general ensembles which have a determinant factor in the weight. These ensembles are relevant, e.g., for spectra of the Dirac…
In 1981, Andr\'e Joyal provided a combinatorial interpretation of the algebra of formal power series, a central gadget in the toolkit of enumerative combinatorics. In Joyal's theory of species of structures, combinatorial species (like…
We develop a theory of umkehr maps for twisted generalized homology theories. In this theory, interesting umkehr maps, including generalizations of important classical ones, are induced by cartesian morphisms of a certain category opfibred…