Results 11 to 20 of about 54 (54)
Integral geometry on discrete matrices
In this note, we study the Radon transform and its dual on the discrete matrices by defining hyperplanes as being infinite sets of solutions of linear Diophantine equations. We then give an inversion formula and a support theorem.
Attioui Abdelbaki
doaj +1 more source
Factorization theorems for strong maps between matroids of arbitrary cardinality
In this paper we present factorization theorems for strong maps between matroids of arbitrary cardinality. Moreover, we present a new way to prove the factorization theorem for strong maps between finite matroids.
Mao Hua
doaj +1 more source
We show that for ⌊d/2⌋ ≤ k ≤ d, the relative interior of every k‐face of a d‐simplex Δd can be intersected by a 2(d − k)‐dimensional affine flat. Bezdek, Bisztriczky, and Connelly′s results [2] show that the condition k ≥ ⌊d/2⌋ above cannot be dropped and hence raise the question of determining, for all 0 ≤ k, j < d, an upper bound on the function c(j,
Nagabhushana Prabhu
wiley +1 more source
Graphic and Cographic Г-Extensions of Binary Matroids
Slater introduced the point-addition operation on graphs to characterize 4-connected graphs. The Г-extension operation on binary matroids is a generalization of the point-addition operation. In general, under the Г-extension operation the properties like
Borse Y.M., Mundhe Ganesh
doaj +1 more source
The Arithmetic Tutte polynomial of two matrices associated to Trees
Arithmetic matroids arising from a list A of integral vectors in Zn are of recent interest and the arithmetic Tutte polynomial MA(x, y) of A is a fundamental invariant with deep connections to several areas. In this work, we consider two lists of vectors
Bapat R. B. +1 more
doaj +1 more source
A greedy algorithm for interval greedoids
We show that the greedy algorithm provided in this paper works for interval greedoids with positive weights under some conditions, and also characterize an exchangeable system to be an interval greedoid with the assistance of the greedy algorithm.
Mao Hua
doaj +1 more source
Power graphs and exchange property for resolving sets
Classical applications of resolving sets and metric dimension can be observed in robot navigation, networking and pharmacy. In the present article, a formula for computing the metric dimension of a simple graph wihtout singleton twins is given.
Abbas Ghulam +4 more
doaj +1 more source
Minor-closed classes of binary functions [PDF]
Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid deletion and ...
Benjamin R. Jones
doaj +1 more source
Tutte polynomials of matroids as universal valuative invariants [PDF]
We provide a full classification of all families of matroids that are closed under duality and minors, and for which the Tutte polynomial is a universal valuative invariant.
Schröter, Benjamin, Ferroni, Luis
core +1 more source
Upho lattices I: examples and non-examples of cores [PDF]
A poset is called upper homogeneous, or "upho," if every principal order filter of the poset is isomorphic to the whole poset. We study (finite type \(\mathbb{N}\)-graded) upho lattices, with an eye towards their classification.
Hopkins, Sam
core +1 more source

