Results 71 to 80 of about 14,016 (208)

Equivariant Hilbert and Ehrhart series under translative group actions

Journal of the London Mathematical Society, Volume 112, Issue 5, November 2025.
Abstract We study representations of finite groups on Stanley–Reisner rings of simplicial complexes and on lattice points in lattice polytopes. The framework of translative group actions allows us to use the theory of proper colorings of simplicial complexes without requiring an explicit coloring to be given.
Alessio D'Alì, Emanuele Delucchi
wiley   +1 more source

Geometric Lattice Structure of Covering-Based Rough Sets through Matroids

Journal of Applied Mathematics, 2012
Covering-based rough set theory is a useful tool to deal with inexact, uncertain, or vague knowledge in information systems. Geometric lattice has been widely used in diverse fields, especially search algorithm design, which plays an important role in ...
Aiping Huang, William Zhu
doaj   +1 more source

Renormalization group-like proof of the universality of the Tutte polynomial for matroids [PDF]

Discrete Mathematics & Theoretical Computer Science, 2013
In this paper we give a new proof of the universality of the Tutte polynomial for matroids. This proof uses appropriate characters of Hopf algebra of matroids, algebra introduced by Schmitt (1994). We show that these Hopf algebra characters are solutions
G. Duchamp, N. Hoang-Nghia, Thomas Krajewski, A. Tanasa   +3 more
doaj   +1 more source

Covering-Based Rough Sets on Eulerian Matroids

Journal of Applied Mathematics, 2013
Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets.
Bin Yang, Ziqiong Lin, William Zhu
doaj   +1 more source

Isotropical Linear Spaces and Valuated Delta-Matroids [PDF]

Discrete Mathematics & Theoretical Computer Science, 2011
The spinor variety is cut out by the quadratic Wick relations among the principal Pfaffians of an $n \times n$ skew-symmetric matrix. Its points correspond to $n$-dimensional isotropic subspaces of a $2n$-dimensional vector space.
Felipe Rincón
doaj   +1 more source

A circle method approach to K‐multimagic squares

Journal of the London Mathematical Society, Volume 112, Issue 3, September 2025.
Abstract In this paper, we investigate K$K$‐multimagic squares of order N$N$. These are N×N$N \times N$ magic squares that remain magic after raising each element to the k$k$th power for all 2⩽k⩽K$2 \leqslant k \leqslant K$. Given K⩾2$K \geqslant 2$, we consider the problem of establishing the smallest integer N2(K)$N_2(K)$ for which there exist ...
Daniel Flores
wiley   +1 more source

Analyzing single-valued neutrosophic fuzzy graphs through matroid perspectives

Ain Shams Engineering Journal
We hope to present this paper on the emergence of a novel category of matroids derived from single-valued neutrosophic (SVN) fuzzy-graphs. The findings of this study make a substantial contribution to both matroid theory and the field of neutrosophic ...
S.M. Balaji, D. Meiyappan, R. Sujatha
doaj   +1 more source

On secret sharing schemes, matroids and polymatroids

Journal of Mathematical Cryptology, 2010
The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem in ...
Martí-Farré Jaume, Padró Carles
doaj   +1 more source

Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids

Journal of Graph Theory, Volume 109, Issue 4, Page 446-453, August 2025.
ABSTRACT We show that the basis graph of an even delta‐matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges e and f sharing a common end, it has a Hamiltonian cycle using e and avoiding f unless it has at most two vertices or it is a cycle of length at most four.
Donggyu Kim, Sang‐il Oum
wiley   +1 more source

Quasiregular Matroids

The Electronic Journal of Combinatorics, 2018
Regular matroids are binary matroids with no minors isomorphic to the Fano matroid $F_7$ or its dual $F_7^*$. Seymour proved that 3-connected regular matroids are either graphs, cographs, or $R_{10}$, or else can be decomposed along a non-minimal exact 3-separation induced by $R_{12}$.
openaire   +2 more sources