相关论文: On symmetry groups of oriented matroids

We call an oriented matroid Mandel if it has an extension in general position which makes all programs with that extension Euclidean. If $L$ is the minimum number of mutations adjacent to an element of the groundset, we call an oriented…

First we introduce a generalization of symmetric spaces to parabolic geometries. We provide construction of such parabolic geometries starting with classical symmetric spaces and we show that all regular parabolic geometries with smooth…

We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the…

We make a systematic study of symmetry-protected topological gapped phases of quantum spin chains in the presence of the frieze space groups in one dimension using matrix product states. Here, the spatial symmetries of the one-dimensional…

We study fixed point sets for holomorphic automorphisms (and endomorphisms) on complex manifolds. The main object of our interest is to determine the number and configuration of fixed points that forces an automorphism (endomorphism) to be…

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for…

In this paper, using 1+1D models as examples, we study symmetries and anomalous symmetries via multi-component partition functions obtained through symmetry twists, and their transformations under the mapping class group of spacetime. This…

We study the rank 4 linear matroid $M(H_4)$ associated with the 4-dimensional root system $H_4$. This root system coincides with the vertices of the 600-cell, a 4-dimensional regular solid. We determine the automorphism group of this…

Rough sets are efficient for data pre-process in data mining. Lower and upper approximations are two core concepts of rough sets. This paper studies generalized rough sets based on symmetric and transitive relations from the…

In this paper, we establish some fixed point theorems in ordered partial metric spaces. An example is given to illustrate our obtained results.

Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…

In this paper, we investigate the existence and uniqueness of fixed points for self-mappings defined on bipolar metric spaces using a new class of contractive conditions, namely polynomial-type contractions. Our main results establish…

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…

Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew…

We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…

In this paper we establish some common fixed point theorem for a new class of pair of contractions mappings, called $\psi-(\alpha,\beta, m)$-contraction pairs, which we will assume occasionally weakly compatible and satisfying the property…

We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group $(G,+)$ is a bijection $f:A\to B$ between two finite subsets $A,B$ of $G$ satisfying $a+f(a)\notin A$ for all $a\in A$. A…

This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally alluded to by Bland and Jensen in their seminal paper on weak…

Symmetric powers of matroids were first introduced by Lovasz and Mason in the 1970s, where it was shown that not all matroids admit higher symmetric powers. Since these initial findings, the study of matroid symmetric powers has remained…