English
Related papers

Related papers: Powerful sets: a generalisation of binary matroids

200 papers

An element $a\in R$ is provided that there exists an idempotent $e\in R$ such that $a-e\in U(R), ae=ea$ and $eae\in J(eRe)$. In this article, we investigate strongly rad-clean matrices over a commutative local ring. We completely determine…

Rings and Algebras · Mathematics 2022-04-29 Huanyin Chen , Handan Kose , Yosum Kurtulmaz

Let $G$ be a group containing a nilpotent normal subgroup $N$ with central series $\{N_j\}$, such that each $N_j/N_{j+1}$ is a $\mathbb{F}$-vector space over a field $\mathbb{F}$ and the action of $G$ on $N_j/N_{j+1}$ induced by the…

Group Theory · Mathematics 2016-08-10 S. G. Dani , Arunava Mandal

Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…

Combinatorics · Mathematics 2007-05-23 James Propp

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

Combinatorics · Mathematics 2024-05-31 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

This paper deals with structural controllability of leader-follower networks. The system matrix defining the network dynamics is a pattern matrix in which a priori given entries are equal to zero, while the remaining entries take nonzero…

Optimization and Control · Mathematics 2018-10-16 Jiajia Jia , Harry L. Trentelman , Wouter Baar , Kanat M. Camlibel

We give new explicit constructions of several fundamental objects in linear-algebraic pseudorandomness and combinatorics, including lossless rank extractors, weak subspace designs, and strong $s$-blocking sets over finite fields. Our focus…

Information Theory · Computer Science 2026-04-16 Zeyu Guo , Roshan Raj , Chong Shangguan , Zihan Zhang

Let $H$ be a group acting on a simply-connected diagrammatically reducible combinatorial 2-complex $X$ with fine 1-skeleton. If the fixed point set $X^ H$ is non-empty, then it is contractible. Having fine 1-skeleton is a weaker version of…

Group Theory · Mathematics 2021-07-09 Shivam Arora , Eduardo Martínez-Pedroza

The sets of strongly supercyclic, weakly l-sequentially supercyclic, weakly sequentially supercyclic, and weakly supercyclic vectors for an arbitrary normed-space operator are all dense in the normed space, regardless the notion of…

Functional Analysis · Mathematics 2021-02-03 C. S. Kubrusly

Let M to be a matroid defined on a finite set E. A subset L of E is locked in M if L is 2-connected in M, the complement of L is 2-connected in the dual M*, and min{r(L), r*(complement of L)} is greater than 1. In this paper, we prove that…

Combinatorics · Mathematics 2016-12-22 Brahim Chaourar

We investigate the strong Rayleigh property of matroids for which the basis enumerating polynomial is invariant under a Young subgroup of the symmetric group on the ground set. In general, the Grace-Walsh-Szeg\H{o} theorem can be used to…

Combinatorics · Mathematics 2014-12-01 Wenbo Gao , David G. Wagner

This work is about symbolic powers of codimension two perfect ideals in a standard polynomial ring over a field, where the entries of the corresponding presentation matrix are general linear forms. The main contribution of the present…

Commutative Algebra · Mathematics 2013-10-30 Aron Simis , Zaqueu Ramos

Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs.…

Information Theory · Computer Science 2024-05-20 Shudi Yang , Tonghui Zhang , Zheng-An Yao

A commutator of unipotent matrices of index 2 is a matrix of the form $XYX^{-1}Y^{-1}$, where $X$ and $Y$ are unipotent matrices of index 2, that is, $X\ne I_n$, $Y\ne I_n$, and $(X-I_n)^2=(Y-I_n)^2=0_n$. If $n>2$ and $\mathbb F$ is a field…

Rings and Algebras · Mathematics 2024-09-23 Kennett L. Dela Rosa , Juan Paolo C. Santos

In this paper, we investigate some properties of symbolic powers and symbolic Rees algebras of binomial edge ideals associated with some classes of block graphs. First, it is shown that symbolic powers of binomial edge ideals of pendant…

Commutative Algebra · Mathematics 2024-09-17 Iman Jahani , Shamila Bayati , Farhad Rahmati

Aim of this paper is to count $0$-dimensional stable and strongly stable ideals in $2$ and $3$ variables, given their (constant) affine Hilbert polynomial. To do so, we define the Bar Code, a bidimensional structure representing any finite…

Combinatorics · Mathematics 2017-01-10 Michela Ceria

In this paper, we propose a uniform approach to tackle problems about squarefree monomial ideals whose powers have good properties. We employ this approach to achieve a twofold goal: (i) recover and extend several well--known results in the…

Commutative Algebra · Mathematics 2025-05-26 Justin Lyle , Paolo Mantero

The enhanced power graph $\mathcal P_e(S)$ of a semigroup $S$ is a simple graph whose vertex set is $S$ and two vertices $x,y \in S$ are adjacent if and only if $x, y \in \langle z \rangle$ for some $z \in S$, where $\langle z \rangle$ is…

Group Theory · Mathematics 2021-10-03 Sandeep Dalal , Jitender Kumar , Siddharth Singh

In this paper, we consider higher order paired symmetric tensors and strongly paired symmetric tensors. Elasticity tensors and higher order elasticity tensors in solid mechanics are strongly paired symmetric tensors. A (strongly) paired…

Rings and Algebras · Mathematics 2017-07-05 Zhenghai Huang , Liqun Qi

Let $\mathcal X$ be an infinite locally compact separable metric space with metric $\rho$ and let $f : \mathcal X \longrightarrow \mathcal X$ be a continuous weakly mixing map. Let $\beta = \sup \big\{ \rho(x, y): \{x, y \} \subset \mathcal…

Dynamical Systems · Mathematics 2020-03-17 Bau-Sen Du

Given a matroid together with a coloring of its ground set, a subset of its elements is called rainbow colored if no two of its elements have the same color. We show that if a binary matroid of rank $r$ is colored with exactly $r$ colors,…

Combinatorics · Mathematics 2021-09-02 Kristóf Bérczi , Tamás Schwarcz