English
Related papers

Related papers: Weighted Subspace Designs from $q$-Polymatroids

200 papers

Blasiak verified a conjecture of White for graphic matroids by showing that the toric ideal of a graphic matroid is generated by quadrics. In this paper, we extend this result to frame matroids satisfying a linearity condition. Such classes…

Combinatorics · Mathematics 2020-04-10 Sean McGuinness

We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…

Combinatorics · Mathematics 2018-02-28 Amanda Cameron , Alex Fink

Superspace of rank $n$ is a $\mathbb{Q}$-algebra with $n$ commuting generators $x_1, \dots, x_n$ and $n$ anticommuting generators $\theta_1, \dots, \theta_n$. We present an extension of the Vandermonde determinant to superspace which…

Combinatorics · Mathematics 2019-07-18 Brendon Rhoades , Andrew Timothy Wilson

Matrix-valued spherical functions related to the quantum symmetric pair for the quantum analogue of $(SU(2) \times SU(2), \text{diag})$ are introduced and studied in detail. The quantum symmetric pair is given in terms of a quantised…

Classical Analysis and ODEs · Mathematics 2021-02-22 Noud Aldenhoven , Erik Koelink , Pablo Román

We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C.…

Information Theory · Computer Science 2013-08-27 Cicero Carvalho

At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…

Artificial Intelligence · Computer Science 2012-09-26 Lirun Su , William Zhu

We make a generalization of the type C monomial space of a single variable, which was introduced in the construction of type C N-fold supersymmetry, to several variables. Then, we construct the most general quasi-solvable second-order…

High Energy Physics - Theory · Physics 2007-05-23 Toshiaki Tanaka

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…

Computational Complexity · Computer Science 2019-06-20 Brahim Chaourar

Let $q$ be a positive integer. In our recent paper, we proved that the cardinality of the complement of an integral arrangement, after the modulo $q$ reduction, is a quasi-polynomial of $q$, which we call the characteristic…

Combinatorics · Mathematics 2011-06-22 Hidehiko Kamiya , Akimichi Takemura , Hiroaki Terao

We unify the study of quotients of matroids, polymatroids, valuated matroids and strong maps of submodular functions in the framework of Murota's discrete convex analysis. As a main result, we compile a list of ten equivalent…

Combinatorics · Mathematics 2025-09-04 Marie-Charlotte Brandenburg , Georg Loho , Ben Smith

We derive a general lower bound for the generalized Hamming weights of nested matrix-product codes, with a particular emphasis on the cases with two and three constituent codes. We also provide an upper bound which is reminiscent of the…

Information Theory · Computer Science 2025-03-17 Rodrigo San-José

In this note we generalize the convolution formula for the Tutte polynomial of Kook-Reiner-Stanton and Etienne-Las Vergnas to a more general setting that includes both arithmetic matroids and delta-matroids. As corollaries, we obtain new…

Combinatorics · Mathematics 2017-04-24 Spencer Backman , Matthias Lenz

Using the notion of generalized weight we improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families of quantum codes.

Quantum Physics · Physics 2007-05-23 Gérard Cohen , Sylvia Encheva , Simon Litsyn

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

Information Theory · Computer Science 2020-12-02 P. G. Boyvalenkov , K. V. Delchev , D. V. Zinoviev , V. A. Zinoviev

We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…

Complex Variables · Mathematics 2025-04-10 Ludovico Bruni Bruno , Federico Piazzon

In the present paper, we provide a cohomology group as a categorification of the characteristic polynomial of matroids. The construction depends on the ``quasi-representation'' of a matroid. For a certain choice of the quasi-representation,…

Combinatorics · Mathematics 2024-09-05 Takuya Saito , So Yamagata

We describe a natural geometric relationship between matroids and underlying flag matroids by relating the geometry of the greedy algorithm to monotone path polytopes. This perspective allows us to generalize the construction of underlying…

Combinatorics · Mathematics 2024-06-25 Alexander E. Black , Raman Sanyal

We study the class of quantum measurements with the property that the image of the set of quantum states under the measurement map transforming states into probability distributions is similar to this set and call such measurements…

Quantum Physics · Physics 2020-10-07 Wojciech Słomczyński , Anna Szymusiak

This paper is concerned with the affine-invariant ternary codes which are defined by Hermitian functions. We compute the incidence matrices of 2-designs that are supported by the minimum weight codewords of these ternary codes. The linear…

Information Theory · Computer Science 2020-07-29 Zhiwen He , Jiejing Wen

Several kinds of q-orthogonal polynomials with |q|=1 are constructed as the main parts of the eigenfunctions of new solvable discrete quantum mechanical systems. Their orthogonality weight functions consist of quantum dilogarithm functions,…

Mathematical Physics · Physics 2016-01-22 Satoru Odake , Ryu Sasaki
‹ Prev 1 8 9 10 Next ›