Related papers: Powerful sets: a generalisation of binary matroids
A ring $R$ is called weakly periodic if every $x \in R$ can be written in the form $x = a + b,$ where $a$ is nilpotent and $b^m = b$ for some integer $m > 1.$ The aim of this note is to consider when a nonzero nilpotent element $r$ is the…
Pairwise comparison matrices are frequently applied in multi-criteria decision making. A weight vector is called efficient if no other weight vector is at least as good in approximating the elements of the pairwise comparison matrix, and…
A combinatorial neural code is a subset of the power set $2^{[n]}$ on $[n]=\{1,\dots, n\}$, in which each $1\leq i\leq n$ represents a neuron and each element (codeword) represents the co-firing event of some neurons. Consider a space…
The enhanced power graph, $\mathcal{E}(G)$, of a group $G$ has vertex set $G$ and two elements are adjacent if they generate a cyclic subgroup. In the case of finite groups, we identify some striking and unexpected properties of these…
We call a matroid element "loose" if it is contained in no circuits of size less than the rank of the matroid. A matroid in which all elements are loose is a paving matroid. Acketa determined all binary paving matroids, while Oxley…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
A binary operation on any set induces a binary operation on its subsets. We explore families of subsets of a group that become a group under the induced operation and refer to such families as power groups of the given group. Our results…
Power nonnegative matrices are defined as complex matrices having at least one nonnegative integer power. We exploit the possibility of deriving a Perron Frobenius-like theory for these matrices, obtaining three main results and drawing…
The enhanced power graph of a group G is a graph with vertex set G, where two distinct vertices x and y are adjacent if and only if there exists an element w in G such that both x and y are powers of w. To obtain the proper enhanced power…
Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…
Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…
For any q which is a power of 2 we describe a finite subgroup of the group of invertible complex q by q matrices under which the complete weight enumerators of generalized doubly-even self-dual codes over the field with q elements are…
Let H be a separable, infinite dimensional Hilbert space and let S be a countable subset of H. Then most positive operators on H have the property that every nonzero vector in the span of S is cyclic, in the sense that the set of operators…
Let $S$ be a family of sequences of positive numbers that decrease to 0, let $X$ be a metric space and $A \subset X$. $A$ is said to be $S$-dominated if, for every $s\in S$, a countable cover $\{E_n\}$ of $E$ can be found such that $diam…
A vertex subset $W\subseteq V$ of the graph $G = (V,E)$ is an independent dominating set if every vertex in $V\setminus W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent…
Pairwise comparison matrices and the weight vectors obtained from them are important concepts in multi-criteria decision making. A weight vector calculated from a pairwise comparison matrix is called Pareto efficient if the approximation of…
Let $G=(V,E)$ be a graph and let $r\ge 1$ be an integer. For a set $D \subseteq V$, define $N_r[x] = \{y \in V: d(x, y) \leq r\}$ and $D_r(x) = N_r[x] \cap D$, where $d(x,y)$ denotes the number of edges in any shortest path between $x$ and…
The directed power graph $\vec{\mathcal P}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted by $\mathcal P(\mathbf G)$,…
Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary…
If $A$ is an integer valued, strictly expansive matrix, then there exists an orthonormal $A$-wavelet whose Fourier transform is compactly supported and smooth. We show that strongly connected diagonally dominant integer matrices are…