Related papers: Constructions of New q-Cryptomorphisms

The T and Y-systems are ubiquitous structures in classical and quantum integrable systems. They are difference equations having a variety of aspects related to commuting transfer matrices in solvable lattice models, q-characters of…

This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a…

We show how the relation between $Q$-manifolds and Lie algebroids extends to ``higher'' or ``non-linear'' analogs of Lie algebroids. We study the identities satisfied by a new algebraic structure that arises as a replacement of operations…

We introduce a definition for a 'hidden measurement system', i.e., a physical entity for which there exist: (i) 'a set of non-contextual states of the entity under study' and (ii) 'a set of states of the measurement context', and which are…

We explore the special structure of the top-dimensional homology of any compact triangulable space $X$ of dimension $d$. Since there are no $(d+1)$-dimensional cells, the top homology equals the top cycles and is thus a free abelian group.…

In this article, we define an independence system for a classical knot diagram and prove that the independence system is a knot invariant for alternating knots. We also discuss the exchange property for minimal unknotting sets. Finally, we…

Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure…

It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary…

A construction of the noncommutative-geometric counterparts of classical classifying spaces is presented, for general compact matrix quantum structure groups. A quantum analogue of the classical concept of the classifying map is introduced…

We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…

The notion of quantum matrix pairs is defined. These are pairs of matrices with non-commuting entries, which have the same pattern of internal relations, q-commute with each other under matrix multiplication, and are such that products of…

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…

Matrix configurations define noncommutative spaces endowed with extra structure including a generalized Laplace operator, and hence a metric structure. Made dynamical via matrix models, they describe rich physical systems including…

It is known that one can construct non-parametric functions by assuming classical axioms. Our work is a converse to that: we prove classical axioms in dependent type theory assuming specific instances of non-parametricity. We also address…

We study the direct sum of q-matroids by way of their cyclic flats. Using that the rank function of a q-matroid is fully determined by the cyclic flats and their ranks, we show that the cyclic flats of the direct sum of two q-matroids are…

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Symmetries and isomorphisms play similar conceptual roles when we consider how models represent physical situations, but they are formally distinct, as two models related by symmetries are not typically isomorphic. I offer a rigorous…

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

Given an indexed family ${\cal A} = (A_1, A_2, \dotsc, A_n)$ of subsets of some given set $S$, a \emph{transversal} is a set of distinct elements $x_1, x_2, \dotsc, x_n$ with each $x_i \in A_i$. Transversals have been studied since 1935 and…

We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on…