English
Related papers

Related papers: Constructions of New q-Cryptomorphisms

200 papers

Properties of Boolean functions on the hypercube invariant with respect to linear transformations of the domain are among the most well-studied properties in the context of property testing. In this paper, we study the fundamental class of…

Computational Complexity · Computer Science 2010-08-30 Arnab Bhattacharyya , Elena Grigorescu , Jakob Nordström , Ning Xie

The origin of nonclassicality in quantum mechanics (QM) has been investigated recently by a number of authors with a view to identifying axioms that would single out quantum mechanics as a special theory within a broader framework such as…

Quantum Physics · Physics 2022-06-07 S. Aravinda , Anirban Pathak , R. Srikanth

Hyperfields and systems are two algebraic frameworks which have been developed to provide a unified approach to classical and tropical structures. All hyperfields, and more generally hyperrings, can be represented by systems. Conversely, we…

Rings and Algebras · Mathematics 2023-04-28 Marianne Akian , Stephane Gaubert , Louis Rowen

When studying entropy functions of multivariate probability distributions, polymatroids and matroids emerge. Entropy functions of pure multiparty quantum states give rise to analogous notions, called here polyquantoids and quantoids.…

Information Theory · Computer Science 2012-10-31 František Matúš

A matroid has been one of the most important combinatorial structures since it was introduced by Whitney as an abstraction of linear independence. As an important property of a matroid, it can be characterized by several different (but…

Combinatorics · Mathematics 2020-09-02 Takanori Maehara , So Nakashima

We characterize the class of threshold matroids by the structure of their defining bases. We also give an example of a shifted matroid which is not threshold, answering a question of Deza and Onn. We conclude by exploring consequences of…

Combinatorics · Mathematics 2025-09-01 Ethan Partida

We study the relationship between a q-analogue of matroids and linear codes with the rank metric in the vector space of matrices with entries in a finite field. We prove a Greene type identity for the rank generating function of these…

Combinatorics · Mathematics 2018-03-19 Keisuke Shiromoto

In a recent paper, Bruhn, Diestel, Kriesell and Wollan (arXiv:1003.3919) present four systems of axioms for infinite matroids, in terms of independent sets, bases, closure and circuits. No system of rank axioms is given. We give an easy…

Combinatorics · Mathematics 2010-05-28 R. A. Pendavingh

Frame matroids and lifted-graphic matroids are two interesting generalizations of graphic matroids. Here we introduce a new generalization, {\em quasi-graphic matroids}, that unifies these two existing classes. Unlike frame matroids and…

Combinatorics · Mathematics 2017-04-25 Jim Geelen , Bert Gerards , Geoff Whittle

Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic…

Combinatorics · Mathematics 2019-03-04 Carolyn Chun , Iain Moffatt , Steven D. Noble , Ralf Rueckriemen

We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed…

Axiomatic quantum field theory (QFT) provides a rigorous mathematical foundation for QFT, and it is the basis for proving some important general results, such as the well-known spin-statistics theorem. Free-field QFT meets the axioms of…

General Physics · Physics 2016-11-23 Ed Seidewitz

Classical designs and their (projective) q-analogs can both be viewed as designs in matroids, using the matroid of all subsets of a set and the matroid of linearly independent subsets of a vector space, respectively. Another natural matroid…

Combinatorics · Mathematics 2016-05-24 Jens Zumbrägel

Any two infinite-dimensional (separable) Hilbert spaces are unitarily isomorphic. The sets of all their self-adjoint operators are also therefore unitarily equivalent. Thus if all self-adjoint operators can be observed, and if there is no…

Quantum Physics · Physics 2009-11-06 A. P. Balachandran

We first give two new proofs of an old result that the reduced Euler characteristic of a matroid complex is equal to the M\"obius number of the lattice of cycles of the matroid up to the sign. The purpose has been to find a model to…

Combinatorics · Mathematics 2022-10-25 Trygve Johnsen , Rakhi Pratihar , Tovohery Hajatiana Randrianarisoa

In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the…

Combinatorics · Mathematics 2015-03-17 Konstantinos Papalamprou , Leonidas Pitsoulis

We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…

Chaotic Dynamics · Physics 2009-11-07 Tsampikos Kottos , Uzy Smilansky

Stochastic matrices and positive maps in matrix algebras proved to be very important tools for analysing classical and quantum systems. In particular they represent a natural set of transformations for classical and quantum states,…

Quantum Physics · Physics 2015-10-28 D. Chruściński , V. I. Man'ko , G. Marmo , F. Ventriglia

We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass of the class of regular…

Combinatorics · Mathematics 2022-10-05 Duksang Lee , Sang-il Oum

We give axiomatic foundations for non-finitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a problem of Rado of 1966.

Combinatorics · Mathematics 2013-02-26 Henning Bruhn , Reinhard Diestel , Matthias Kriesell , Rudi Pendavingh , Paul Wollan