相关论文: Maximal entries of elements in certain matrix mono…

This paper proposes new notions of polynomial depth (called monotone poly depth), based on a polynomial version of monotone Kolmogorov complexity. We show that monotone poly depth satisfies all desirable properties of depth notions i.e.,…

In this paper we consider a refinement, due to Nathanson, of the Calkin-Wilf tree. In particular, we study the properties of such trees associated with the matrices $L_u=\begin{bmatrix} 1 & 0 \\ u & 1\end{bmatrix}$ and $R_v=\begin{bmatrix}…

We compute the type (maximum linearization) of the well partial order of bounded lower sets in $\mathbb{N}^m$, ordered under inclusion, and find it is $\omega^{\omega^{m-1}}$. Moreover we compute the type of the set of all lower sets in…

We prove exponential lower bounds on the size of homogeneous depth 4 arithmetic circuits computing an explicit polynomial in $VP$. Our results hold for the {\it Iterated Matrix Multiplication} polynomial - in particular we show that any…

We study the online submodular maximization problem with free disposal under a matroid constraint. Elements from some ground set arrive one by one in rounds, and the algorithm maintains a feasible set that is independent in the underlying…

We investigate the detectability of modules in large networks when the number of modules is not known in advance. We employ the minimum description length (MDL) principle which seeks to minimize the total amount of information required to…

We prove estimates for $\mathbb{E} \| X: \ell_{p'}^n \to \ell_q^m\|$ for $p,q\ge 2$ and any random matrix $X$ having the entries of the form $a_{ij}Y_{ij}$, where $Y=(Y_{ij})_{1\le i\le m, 1\le j\le n}$ has i.i.d. isotropic log-concave…

We consider a fast approximation algorithm for the linear matroid intersection problem. In this problem, we are given two $r \times n$ matrices $M_1$ and $M_2$, and the objective is to find a largest set of columns that are linearly…

A recent breakthrough by K\"unnemann, Mazowiecki, Sch\"utze, Sinclair-Banks, and Wegrzycki (ICALP, 2023) bounds the running time for the coverability problem in $d$-dimensional vector addition systems under unary encoding to $n^{2^{O(d)}}$,…

The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often wish to enforce various constraints; the matroid constraint…

Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider…

A family $\mathcal{F}$ of subsets of $[n]=\{1,2,\ldots,n\}$ shatters a set $A \subseteq [n]$ if for every $A' \subseteq A$ there is an $F \in \mathcal{F}$ such that $F \cap A=A'$. We develop a framework to analyze $f(n,k,d)$, the maximum…

We show that a set function $\nu$ satisfies the gross substitutes property if and only if its homogeneous generating polynomial $Z_{q,\nu}$ is a Lorentzian polynomial for all positive $q \le 1$, answering a question of Eur-Huh. We achieve…

Let n be an integer, and consider finite sequences of elements of the group Z/nZ x Z/nZ. Such a sequence is called zero-sum free, if no subsequence has sum zero. It is known that the maximal length of such a zero-sum free sequence is 2n-2,…

The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Recently, Brualdi and Cao studied $I_k$-avoiding $(0,1)$-matrices by decomposing them into zigzag paths and proved that the maximum number of $1$'s in such a matrix is given by an exact formula. We further study the structure of maximal…

We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the…

Let $A$ and $B$ be two maximal abelian *-subalgebras of the $n\times n$ complex matrices $M_n(\mathbb{C}).$ To study the movement of the inner automorphisms of $M_n(\mathbb{C}),$ we modify the Connes-St$\o$rmer relative entropy $H(A | B)$…

For a numerical monoid $\langle n_1, \dots, n_k \rangle$ minimally generated by $n_1, \dots, n_k \in \mathbb{N}$ with $n_1 < \cdots < n_k$, the longest and shortest factorization lengths of an element $x$, denoted as $L(x)$ and $\ell(x)$,…