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

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field $\mathbb F$, the list…

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

We provide an $O(n \log n)$ algorithm computing the linear maximum induced matching width of a tree and an optimal layout.

Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…

We introduce several classes of monoids satisfying up to five axioms and establish basic theories on their arithmetics. The one satisfying all the axioms is named natural monoid. Two typical examples are 1) the monoid $\mathbb{N}$ of…

We prove a hypercontractive inequality for matrix-valued functions defined over large alphabets. In order to do so, we prove a generalization of the powerful $2$-uniform convexity inequality for trace norms of Ball, Carlen, Lieb…

A formula due to Sudakov relates the first intrinsic volume of a convex set in a Hilbert space to the maximum of the isonormal Gaussian process over this set. Using this formula we compute the first intrinsic volumes of infinite-dimensional…

In the numerical linear algebra community, it was suggested that to obtain nearly optimal bounds for various problems such as rank computation, finding a maximal linearly independent subset of columns (a basis), regression, or low-rank…

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…

A matrix is called Bohemian if its entries are sampled from a finite set of integers. We determine the maximum absolute determinant of upper Hessenberg Bohemian Matrices for which the subdiagonal entries are fixed to be $1$ and upper…

Several problems such as network intrusion, community detection, and disease outbreak can be described by observations attributed to nodes or edges of a graph. In these applications presence of intrusion, community or disease outbreak is…

We consider a general symmetric $(3\times 3)$ mass matrix for three generations of neutrinos. Imposing the constraints, from the atmospheric neutrino and solar neutrino anomalies as well as from the CHOOZ experiment, on the mass squared…

This article studies the categorical setting of Abramsky, Haghverdi, and Scott's untyped linear combinatory algebras, and relates this to more recent work of Abramsky and Heunen on Frobenius algebras in the infinitary setting. The key to…

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 upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…

When rows of an $n \times d$ matrix $A$ are given in a stream, we study algorithms for approximating the top eigenvector of the matrix ${A}^TA$ (equivalently, the top right singular vector of $A$). We consider worst case inputs $A$ but…

Let $\mathcal{A}(R,S)$ denote the class of all matrices of zeros and ones with row sum vector $R$ and column sum vector~$S$. We introduce the notion of an inversion in a $(0,1)$--matrix. This definition extends the standard notion of an…

Let $U_N$ denote a Haar Unitary matrix of dimension N, and consider the field \[ {\bf U}(z) = \log |\det(1-zU_N)| \] for z in the unit disk. Then, \[ \frac{\max_{|z|=1} {\bf U}(z) -\log N + \frac{3}{4} \log\log N} {\log\log N} \to 0 \] in…

In this paper, we leverage an information-theoretic upper bound on the maximum admissible level of noise (MALN) in convex Lipschitz-continuous zeroth-order optimisation to establish corresponding upper bounds for classes of strongly convex…

We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an…

We prove that hashing $n$ balls into $n$ bins via a random matrix over $\mathbf{F}_2$ yields expected maximum load $O(\log n / \log \log n)$. This matches the expected maximum load of a fully random function and resolves an open question…