相关论文: On the Rank Functions of Powerful Sets

Given the action of a group $G$ on a set $ X $ , the set of $ G $ -equivariant functions, those that commute with the action, i.e., $ f(g \cdot x) = g \cdot f(x) $ for all $ x \in X $ , $ g \in G $ , forms a monoid under function…

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid…

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…

This paper is concerned with certain generalizations of meagreness and their combinatorial equivalents. The simplest example, and the one which motivated further study in this area, comes about by considering the following definition: a set…

Idempotents yield much insight in the structure of finite semigroups and semirings. In this article, we obtain some results on (multiplicatively) idempotents of the endomorphism semiring of a finite chain. We prove that the set of all…

We study higher order quantum maps in the context of a *-autonomous category of affine subspaces. We show that types of higher order maps can be identified with certain Boolean functions that we call type functions. By an extension of this…

The current work introduces the notion of pdominant sets and studies their recursion-theoretic properties. Here a set A is called pdominant iff there is a partial A-recursive function {\psi} such that for every partial recursive function…

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…

One says that a pair of sets $(S,Q)$ in $\mathbb{R}$ is 'annihilating' if no function can be concentrated on $S$ while having its Fourier transform concentrated on $Q$. One uses to distinguish between weak and strong annihilation types. It…

We know that for a finite field $F$, every function on $F$ can be given by a polynomial with coefficients in $F$. What about the converse? i.e. if $R$ is a ring (not necessarily commutative or with unity) such that every function on $R$ can…

The rank of a ring $R$ is the supremum of minimal cardinalities of generating sets of $I$ as $I$ ranges over ideals of $R$. Matson showed that every positive integer occurs as the rank of some ring $R$. Motivated by the result of Cohen and…

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Rank and select queries on bitmaps are essential building bricks of many compressed data structures, including text indexes, membership and range supporting spatial data structures, compressed graphs, and more. Theoretically considered yet…

We study ranks of the $r\textrm{th}$ Hadamard powers of doubly nonnegative matrices and show that the matrix $A^{\circ r}$ is positive definite for every $n\times n$ doubly nonnegative matrix $A$ and for every $r>n-2$ if and only if no…

The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…

This study explores in-depth the structure and properties of the so-called {\it strongly $\Delta$-clean rings}, that is a novel class of rings in which each ring element decomposes into a sum of a commuting idempotent and an element from…

We give explicit recursive constructions for the polytope of all matroids $\Omega_{r,n}$ in ranks 2 and 3 for all ground set sizes. This polytope was introduced in recent work by Ferroni and Fink as a tool for checking positivity…

Gross substitutability is a central concept in Economics and is connected to important notions in Discrete Convex Analysis, Number Theory and the analysis of Greedy algorithms in Computer Science. Many different characterizations are known…

Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry pattern can be uniquely completed to a specific rank, called the…

Given a nonnegative matrix M with rational entries, we consider two quantities: the usual positive semidefinite (psd) rank, where the matrix is factored through the cone of real symmetric psd matrices, and the rational-restricted psd rank,…