Results 1 to 10 of about 54 (54)
Schubert matroids, Delannoy paths, and Speyer's invariant [PDF]
, 2023 We provide a combinatorial way of computing Speyer's \(g\)-polynomial on arbitrary Schubert matroids via the enumeration of certain Delannoy paths. We define a new statistic of a basis in a matroid, and express the \(g\)-polynomial of a Schubert matroid ...
Ferroni, Luis,, Ferroni, Luis
core +1 more source
Von Staudt constructions for skew-linear and multilinear matroids [PDF]
, 2023 This paper compares skew-linear and multilinear matroid representations. These are matroids that are representable over division rings and (roughly speaking) invertible matrices, respectively.
Kühne, Lukas +3 more
core +1 more source
Even circuits in oriented matroids [PDF]
, 2022 In this paper we generalise the even directed cycle problem, which asks whether a given digraph contains a directed cycle of even length, to orientations of regular matroids.
Heuer, Karl +2 more
core +1 more source
The homogenized Linial arrangement and Genocchi numbers [PDF]
, 2022 We study the intersection lattice of a hyperplane arrangement recently introduced by Hetyei who showed that the number of regions of the arrangement is a median Genocchi number.
Wachs, Michelle L., +3 more
core +1 more source
A generalization of Kruskal’s theorem on tensor decomposition
Forum of Mathematics, Sigma, 2023 Kruskal’s theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large.
Benjamin Lovitz, Fedor Petrov
doaj +1 more source
Compression with wildcards: All exact or all minimal hitting sets
Open Mathematics, 2023 Our objective is the compressed enumeration (based on wildcards) of all minimal hitting sets of general hypergraphs. To the author’s best knowledge, the only previous attempt towards compression, due to Toda, is based on binary decision diagrams and much
Wild Marcel
doaj +1 more source
Journal of Mathematical Cryptology, 2020 Secret sharing is an important building block in cryptography. All explicit secret sharing schemes which are known to have optimal complexity are multi-linear, thus are closely related to linear codes.
Csirmaz Laszlo
doaj +1 more source
On triangular matroids induced by n3-configurations
Open Mathematics, 2020 A triangular matroid is a rank-3 matroid whose ground set consists of the points of an n3{n}_{3}-configuration and whose bases are the point triples corresponding to non-triangles within the configuration.
Alazemi Abdullah, Raney Michael
doaj +1 more source
Irreversible 2-conversion set in graphs of bounded degree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 An irreversible $k$-threshold process (also a $k$-neighbor bootstrap percolation) is a dynamic process on a graph where vertices change color from white to black if they have at least $k$ black neighbors. An irreversible $k$-conversion set of a graph $G$
Jan Kynčl +2 more
doaj +1 more source
A note on minimal resolutions of vector–spread Borel ideals
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 We consider vector–spread Borel ideals. We show that these ideals have linear quotients and thereby we determine the graded Betti numbers and the bigraded Poincaré series.
Crupi Marilena, Ficarra Antonino
doaj +1 more source