Related papers: Maximum Dimension of Subspaces with No Product Bas…

A $d$-hypertree on $[n]$ is a maximal acyclic $d$-dimensional simplicial complex with full $(d-1)$-skeleton on the vertex set $[n]$. Alternatively, in the language of algebraic topology, it is a minimal $d$-dimensional simplicial complex…

We study the principal-agent problem. We show that $b$-convexity of the space of products, a condition which appears in a recent paper by Figalli, Kim and McCann \cite{fkm}, is necessary to formulate the problem as a maximization over a…

Let $\mathcal{P}$ be an $n$-point subset of Euclidean space and $d\geq 3$ be an integer. In this paper we study the following question: What is the smallest (normalized) relative change of the volume of subsets of $\mathcal{P}$ when it is…

Let $F$ be a field. We show that the largest irredundant generating sets for the algebra of $n\times n $ matrices over $F$ have $2n-1$ elements when $n>1$. (A result of Laffey states that the answer is $2n-2$ when $n>2$, but its proof…

K be a field and let m and n be positive integers, where m does not exceed n. We say that a non-zero subspace of m x n matrices over K is a constant rank r subspace if each non-zero element of the subspace has rank r, where r is a positive…

In projective dimension growth results, one bounds the number of rational points of height at most $H$ on an irreducible hypersurface in $\mathbb P^n$ of degree $d>3$ by $C(n)d^2 H^{n-1}(\log H)^{M(n)}$, where the quadratic dependence in…

We develop a strong connection between maximally commuting bases of orthogonal unitary matrices and mutually unbiased bases. A necessary condition of the existence of mutually unbiased bases for any finite dimension is obtained. Then a…

Let $\mathcal{K}$ be a discrete valued field with finite residue field. In analogy with orthogonality in the Euclidean space $\mathbb{R}^n$, there is a well-studied notion of "ultrametric orthogonality" in $\mathcal{K}^n$. In this paper,…

In this paper, we provide a non-homogeneous $T(1)$ theorem on product spaces $(X_1 \times X_2, \rho_1 \times \rho_2, \mu_1 \times \mu_2)$ equipped with a quasimetric $\rho_1 \times \rho_2$ and a Borel measure $\mu_1 \times \mu_2$, which,…

Let $M(n,d)$ be the maximum size of a permutation array on $n$ symbols with pairwise Hamming distance at least $d$. Some permutation arrays can be constructed using blocks of certain type [2] called product blocks in this paper. We study…

There exists a set $A$ of positive integers such that the number of representations of a large positive integer $m$ as a sum of two elements of $A$ grows with a lower bound of order $\log m$, but for which there is no subset $D$ of $A$…

We consider non-parametric estimation and inference of conditional moment models in high dimensions. We show that even when the dimension $D$ of the conditioning variable is larger than the sample size $n$, estimation and inference is…

Let $M$ be smooth $n$-dimensional manifold, fibered over a $k$-dimensional submanifold $B$ as $\pi:M \to B$, and $\vartheta \in \Lambda^k (M)$; one can consider the functional on sections $\phi$ of the bundle $\pi$ defined by $\int_D \phi^*…

Unextendible product bases (UPBs) provide a versatile tool with various applications across different areas of quantum information theory. Their comprehensive characterization is thus of great importance and has been a subject of vital…

Let $\mathscr{S}_n(q)$ denote the set of symmetric bilinear forms over an $n$-dimensional $\mathbb{F}_q$-vector space. A subset $\mathcal{C}$ of $\mathscr{S}_n(q)$ is called a $d$-code if the rank of $A-B$ is larger than or equal to $d$ for…

In this paper we study measure theoretical size of the image of naturally embedded vector bundles in $\mathbb{R}^{n} \times \mathbb{R}^{n}$ under the codiagonal morphism, i.e. $\Delta_{*}$ in the category of finite dimensional…

We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\mathbb{Q}^d$ can be approximated with a factor of $O(\log d)^{d/2}$ in polynomial time. This improves upon the previously best known…

We propose a procedure to determine the dimension of the common factor space in a large, possibly non-stationary, dataset. Our procedure is designed to determine whether there are (and how many) common factors (i) with linear trends, (ii)…

The dimension of a linear space is the maximum positive integer $d$ such that any $d$ of its points generate a proper subspace. For a set $K$ of integers at least two, recall that a pairwise balanced design PBD$(v,K)$ is a linear space on…

For a positive integer $n$, let $[n]$ denote $\{1, \ldots, n\}$. For a 2-dimensional integer lattice point $\mathbf{b}$ and positive integers $k\geq 2$ and $n$, a \textit{$k$-sum $\mathbf{b}$-free set} of $[n]\times [n]$ is a subset $S$ of…