Related papers: Entropic Weighted Rank Function

We study two possible tropical analogues of Weierstrass semigroups on graphs, called rank and functional Weierstrass sets. We prove that on simple graphs, the first is contained in the second. We completely characterize the subsets of N…

We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…

We establish necessary and sufficient conditions for the N-representability of the universal one-electron reduced density matrix functional. Functionals satisfying these conditions are guaranteed to yield variational upper bounds on the…

We introduce the Hadamard topology on the Witt ring of rational functions, giving a simultaneous refinement of the weight and point-counting topologies. Zeta functions of algebraic varieties over finite fields are elements of the rational…

The concept of weighted entropy takes into account values of different outcomes, i.e., makes entropy context-dependent, through the weight function. In this paper, we establish a number of simple inequalities for the weighted entropies…

Employing two models, we show that various counting functions of a random variable defined by restriction or contraction of a ranked set with multiplicity (e.g., classical and arithmetic matroids) have expectations given by the…

It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In…

Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…

Polymatroids can be considered as "fractional matroid" where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a…

Problems in econometrics, insurance, reliability engineering, and statistics quite often rely on the assumption that certain functions are non-decreasing. To satisfy this requirement, researchers frequently model the underlying phenomena…

We consider semiparametric location-scatter models for which the $p$-variate observation is obtained as $X=\Lambda Z+\mu$, where $\mu$ is a $p$-vector, $\Lambda$ is a full-rank $p\times p$ matrix and the (unobserved) random $p$-vector $Z$…

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…

We define a functor which gives the "global rank of a quiver representation" and prove that it has nice properties which make it a generalization of the rank of a linear map. We demonstrate how to construct other "rank functors" for a…

We study the mean-value harmonic functions on open subsets of $\mathbb{R}^n$ equipped with weighted Lebesgue measures and norm induced metrics. Our main result is a necessary condition saying that all such functions solve a certain…

Constrained maximization of submodular functions poses a central problem in combinatorial optimization. In many realistic scenarios, a number of agents need to maximize multiple submodular objectives over the same ground set. We study such…

The rank of neural networks measures information flowing across layers. It is an instance of a key structural condition that applies across broad domains of machine learning. In particular, the assumption of low-rank feature representations…

A simple proof of the fact that each rank-one infinite measure preserving (i.m.p.) transformation is subsequence weakly rationally ergodic is found. Some classes of funny rank-one i.m.p. actions of Abelian groups are shown to be subsequence…

Motivated by a problem in computational complexity, we consider the behavior of rank functions for tensors and polynomial maps under random coordinate restrictions. We show that, for a broad class of rank functions called natural rank…

The nonnegative integer rank of a matrix is a variant of the classical nonnegative rank, introduced in the 1980s, where factorizations are required to have integer entries. While computing nonnegative integer rank is generally very hard, we…

We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic…