Related papers: Maximal entries of elements in certain matrix mono…

Rigid frameworks in some Euclidian space are embedded graphs having a unique local realization (up to Euclidian motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings…

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) $m(T)$ of a tree $T$ of given order. While the trees that attain the lower bound are easily characterised, the trees with…

We consider natural complex Hamiltonian systems with $n$ degrees of freedom given by a Hamiltonian function which is a sum of the standard kinetic energy and a homogeneous polynomial potential $V$ of degree $k>2$. The well known…

An $L$-matrix is a matrix whose off-diagonal entries belong to a set $L$, and whose diagonal is zero. Let $N(r,L)$ be the maximum size of a square $L$-matrix of rank at most $r$. Many applications of linear algebra in extremal combinatorics…

For positive integers $u$ and $v$, let $L_u=\begin{bmatrix}1 & 0 \\u&1\end{bmatrix}$ and $R_v=\begin{bmatrix}1 & v \\ 0 & 1\end{bmatrix}$. Let $G_{u,v}$ be the group generated by $L_u$ and $R_v$. In a previous paper, the authors determined…

This study explores the number of neurons required for a Rectified Linear Unit (ReLU) neural network to approximate multivariate monomials. We establish an exponential lower bound on the complexity of any shallow network approximating the…

Many problems in computer vision and recommender systems involve low-rank matrices. In this work, we study the problem of finding the maximum entry of a stochastic low-rank matrix from sequential observations. At each step, a learning agent…

We introduce a new model to study algorithm design under unreliable information, and apply this model for the problem of finding the uncorrupted maximum element of a list containing $n$ elements, among which are $k$ corrupted elements.…

We extend the theory of low-rank matrix recovery and completion to the case when Poisson observations for a linear combination or a subset of the entries of a matrix are available, which arises in various applications with count data. We…

A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi shows that every large $n$-vertex graph with minimum degree at least $(1/2+\gamma)n$ contains all spanning trees of bounded degree. We generalised this result to loose spanning…

We give an alternative description of the grammic monoid in terms of weakly increasing subsequences. Specifically, we show that words $u,v$ in the generators $\{1,\ldots, n\}$ determine the same element of the grammic monoid of rank $n$ if…

The rigidity of a matrix $A$ for target rank $r$ is the minimum number of entries of $A$ that need to be changed in order to obtain a matrix of rank at most $r$. At MFCS'77, Valiant introduced matrix rigidity as a tool to prove circuit…

Since the work of Jennings (1955), it is well-known that any finitely generated torsion-free nilpotent group can be embedded into unitriangular integer matrices $UT_N(Z)$ for some $N$. In 2006, Nickel proposed an algorithm to calculate such…

The monotone minimal perfect hash function (MMPHF) problem is the following indexing problem. Given a set $S= \{s_1,\ldots,s_n\}$ of $n$ distinct keys from a universe $U$ of size $u$, create a data structure $DS$ that answers the following…

Let $(R,\mm)$ be a Noetherian local ring and $M$ a finitely generated $R$-module. We say $M$ has maximal depth if there is an associated prime $\pp$ of $M$ such that $\depth M=\dim R/\pp$. In this paper we study squarefree monomial ideals…

This article aims to study some $n$-tuples of elements belonging to a ring $\mathbb{Z}/N\mathbb{Z}$ related to the combinatorics of congruence subgroups of the modular group. More precisely, we will focus here on the notion of minimal…

We derive explicit expressions for the volume elements of both the minimal and maximal monotone metrics over the (n^{2} - 1)-dimensional convex set of n x n density matrices for the cases n = 3 and 4. We make further progress for the…

Understanding the relationship between the depth of a neural network and its representational capacity is a central problem in deep learning theory. In this work, we develop a geometric framework to analyze the expressivity of ReLU networks…

David Gabai showed that disk decomposable knot and link complements carry taut foliations of depth one. In an arbitrary sutured 3-manifold M, such foliations F, if they exist at all, are determined up to isotopy by an associated ray [F]…