English
Related papers

Related papers: Powerful sets: a generalisation of binary matroids

200 papers

A rank-$r$ integer matrix $A$ is $\Delta$-modular if the determinant of each $r \times r$ submatrix has absolute value at most $\Delta$. The class of $1$-modular, or unimodular, matrices is of fundamental significance in both integer…

Combinatorics · Mathematics 2024-05-03 James Oxley , Zach Walsh

Idempotent elements play a fundamental role in ring theory, as they encode significant information about the underlying algebraic structure. In this paper, we study idempotent matrices from two perspectives. First, we analyze the partially…

Rings and Algebras · Mathematics 2025-10-13 Sen-Peng Eu , Yong-Siang Lin , Wei-Liang Sun

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

Number Theory · Mathematics 2024-11-07 Antonio Cafure , Eda Cesaratto

Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of cohesive powers $\Pi _{C}% \mathcal{L}$ for familiar…

Let $(G,+)$ be an Abelian group. Given $h\in \mathbb{Z}^+$, a non-empty subset $A$ of $G$ is called an $S_h$-set if all the sums of $h$ distinct elements of $A$ are different. We extend the concept of $S_h$-set to a more general context in…

In this work, we define three composite matrices derived from group rings. We employ these composite matrices to create generator matrices of the form [In | {\Omega}(v)], where In is the identity matrix and {\Omega}(v) is a composite matrix…

Information Theory · Computer Science 2021-02-02 Adrian Korban , Serap Sahinkaya , Deniz Ustun

The aim of this paper is to describe the classes of strongly flat and weakly cotorsion modules with respect to a multiplicative subset or a finite collection of multiplicative subsets in a commutative ring. The strongly flat modules are…

Commutative Algebra · Mathematics 2019-04-08 Leonid Positselski , Alexander Slavik

In this paper, we investigate the componentwise linearity and the Castelnuovo-Mumford regularity of symbolic powers of polymatroidal ideals. For a polymatroidal ideal $I$, we conjecture that every symbolic power $I^{(k)}$ is componentwise…

Commutative Algebra · Mathematics 2025-02-28 Antonino Ficarra , Somayeh Moradi

A space $X$ is called {\it selectively pseudocompact} if for each sequence $(U_{n})_{n\in \mathbb{N}}$ of pairwise disjoint nonempty open subsets of $X$ there is a sequence $(x_{n})_{n\in \mathbb{N}}$ of points in $X$ such that $cl_X(\{x_n…

General Topology · Mathematics 2017-06-16 S. Garcia-Ferreira , A. H. Tomita

Consider the set of scalars $\alpha$ for which the $\alpha$th Hadamard power of any $n\times n$ positive semi-definite (p.s.d.) matrix with non-negative entries is p.s.d. It is known that this set is of the form $\{0, 1, \dots, n-3\}\cup…

Classical Analysis and ODEs · Mathematics 2022-06-15 Jnaneshwar Baslingker , Biltu Dan

This paper deals with strong structural controllability of linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. Instead of assuming that the nonzero and arbitrary entries of the system…

Optimization and Control · Mathematics 2020-03-05 Jiajia Jia , Harry L. Trentelman , Nikolaos Charalampidis , M. Kanat Camlibel

In this paper we continue the study of powerfully nilpotent groups. These are powerful $p$-groups possessing a central series of a special kind. To each such group one can attach a powerful nilpotency class that leads naturally to the…

Group Theory · Mathematics 2020-02-10 Gunnar Traustason , James Williams

Let $G$ be a finite group. The order supergraph of $G$ is the graph with vertex set $G$, and two distinct vertices $x,y$ are adjacent if $o(x)\mid o(y)$ or $o(y)\mid o(x)$. The enhanced power graph of $G$ is the graph whose vertex set is…

Combinatorics · Mathematics 2021-04-29 Xuanlong Ma , Liangliang Zhai

A matroid of rank $r$ on $n$ elements is a positroid if it has a representation by an $r$ by $n$ matrix over $\mathbb{R}$, each $r$ by $r$ submatrix of which has nonnegative determinant. Earlier characterizations of connected positroids and…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

We investigate the existence of heavy columns in binary matrices with distinct rows. A column of an m x n binary matrix is called heavy if the number of ones in it is at least m/2. We introduce two recursive algorithms, A1 and A2, that…

Discrete Mathematics · Computer Science 2026-01-27 Jamolidin K. Abdurakhmanov

This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…

Combinatorics · Mathematics 2011-09-07 Peter J. Cameron , Maximilien Gadouleau , Søren Riis

An element $g$ of a group is called {\em reversible} if it is conjugate in the group to its inverse. This paper is about reversibles in the group $G$ of formally-invertible pairs of formal power series in two variables, with complex…

Complex Variables · Mathematics 2022-03-22 Anthony G. O'Farrell , Dmitri Zaitsev

An $s$-subset of codewords of a binary code $X$ is said to be an {\em $(s,\ell)$-bad} in $X$ if the code $X$ contains a subset of other $\ell$ codewords such that the conjunction of the $\ell$ codewords is covered by the disjunctive sum of…

Information Theory · Computer Science 2015-03-26 Arkadii D'yachkov , Ilya Vorobyev , Nikita Polyanskii , Vladislav Shchukin

We prove inheritance of measure zero property of the set of singular vectors for affine subspaces and submanifolds inside those affine subspaces. We define a notion of $n$-singularity for matrices, which is closely related to the uniform…

Number Theory · Mathematics 2022-08-30 Shreyasi Datta , Yewei Xu

Metacirculants are a rich resource of many families of interesting graphs, and weak metacirculants are generalizations of them. A graph is called a {\em split weak metacirculant} if it has a vertex-transitive split metacyclic automorphism…

Combinatorics · Mathematics 2018-10-04 Li Cui , Jin-Xin Zhou