English
Related papers

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

200 papers

An axis-parallel $d$--dimensional box is a Cartesian product $R_1 \times R_2 \times ... \times R_d$ where $R_i$ (for $1 \le i \le d$) is a closed interval of the form $[a_i, b_i]$ on the real line. For a graph $G$, its \emph{boxicity}…

Combinatorics · Mathematics 2007-05-23 L. Sunil Chandran , Mathew C. Francis , Naveen Sivadasan

Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals…

Combinatorics · Mathematics 2019-05-06 Jun Seok Oh , Qinghai Zhong

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where…

Group Theory · Mathematics 2008-04-07 Kiran S. Kedlaya , Xuancheng Shao

We study Schmidt rank for a vector (i.e., a pure state) and Schmidt number for a mixed state which are entanglement measures. We show that if a subspace of a certain bipartite system contains no vector of Schmidt rank $\leqslant k$, then…

Quantum Physics · Physics 2018-04-13 Priyabrata Bag , Santanu Dey

A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…

Combinatorics · Mathematics 2020-07-28 Hiroshi Nozaki , Masashi Shinohara

Given a numerical semigroup $S = < a_1, a_2,..., a_t>$ and $s\in S$, we consider the factorization $s = c_1 a_1 + c_2 a_2 +... + c_t a_t$ where $c_i\ge0$. Such a factorization is {\em maximal} if $c_1+c_2+...+c_t$ is a maximum over all such…

Commutative Algebra · Mathematics 2014-07-15 Lance Bryant , James Hamblin , Lenny Jones

Let $f(n)$ be the largest integer such that every poset on $n$ elements has a $2$-dimensional subposet on $f(n)$ elements. What is the asymptotics of $f(n)$? It is easy to see that $f(n)\geqslant n^{1/2}$. We improve the best known upper…

Combinatorics · Mathematics 2017-11-28 Grzegorz Guśpiel , Piotr Micek , Adam Polak

A set of $N$ points is chosen randomly in a $D$-dimensional volume $V=a^D$, with periodic boundary conditions. For each point $i$, its distance $d_i$ is found to its nearest neighbour. Then, the maximal value is found, $d_{max}=max(d_i,…

Computational Physics · Physics 2014-08-26 Malgorzata J. Krawczyk , Janusz Malinowski , Krzysztof Kulakowski

The main result of this paper is the following: if F is any field and R is any F-subalgebra of the algebra of nxn matrices over F with Lie nilpotence index m, then the F-dimension of R is less or equal than M(m+1,n), where M(m+1,n) is the…

Rings and Algebras · Mathematics 2020-10-29 J. Szigeti , J. van den Berg , L. van Wyk , M. Ziembowski

In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions $d$ that are powers of prime numbers, there exists a set of up to $d+1$ bases that form an MUB set.…

Let $D$ be a division ring with center $F$, $f(x_1,x_2,\dots, x_m)$ a non-central multilinear polynomial over $F$, and $w(x_1,x_2,\dots,x_m)$ a non-trivial word. In this paper, we investigate conditions under which there exists an element…

Rings and Algebras · Mathematics 2025-05-20 Le Qui Danh , Trinh Thanh Deo

In analogy with the maximal tensor product of $C^*$-algebras, we define the ``maximal" tensor product $E_1\otimes_\mu E_2$ of two operator spaces $E_1$ and $E_2$ and we show that it can be identified completely isometrically with the sum of…

Functional Analysis · Mathematics 2016-09-07 Timur Oikhberg , Gilles Pisier

In this paper we study the cardinality of the dot product set generated by two subsets of vector spaces over finite fields. We notice that the results on the dot product problems for one set can be simply extended to two sets. Let E and F…

Combinatorics · Mathematics 2014-01-28 Doowon Koh , Youngjin Pi

Let $V$ be the set of real common solutions to $F = (f_1, \ldots, f_s)$ in $\mathbb{R}[x_1, \ldots, x_n]$ and $D$ be the maximum total degree of the $f_i$'s. We design an algorithm which on input $F$ computes the dimension of $V$. Letting…

Symbolic Computation · Computer Science 2021-06-15 Piere Lairez , Mohab Safey El Din

Starting from the vector multipliers, the inner product, norm, distance, as well as addition of two vectors of different dimensions are proposed, which makes the spaces into a topological vector space, called the Euclidean space of…

Systems and Control · Electrical Eng. & Systems 2022-11-15 Daizhan Cheng , Zhengping Ji

Given an additively written abelian group $G$ and a set $X\subseteq G$, we let $\mathsf{D}(X)$ denote the Davenport constant of $X$, namely the largest non-negative integer $n$ for which there exists a sequence $x_1, \dots, x_n$ of elements…

Number Theory · Mathematics 2025-10-24 Benjamin Girard , Alain Plagne

Let f be an entire function of finite order less than 1. The maximum modulus M(r) of f and the counting function of the zeros N(r) are connected by a best possible growth inequality known as Valiron's Theorem: For functions subharmonic in…

Complex Variables · Mathematics 2022-01-31 Faruk F. Abi-Khuzam

Two orthonormal bases B and B' of a d-dimensional complex inner-product space are called mutually unbiased if and only if |<b|b'>|^2=1/d holds for all b in B and b' in B'. The size of any set containing (pairwise) mutually unbiased bases of…

Quantum Physics · Physics 2023-11-27 Andreas Klappenecker , Martin Roetteler

Why does the low dimensionality of representations, typically $d\approx 1000$, not prevent modern embedding-based retrieval models from scaling to billions, or even trillions, of data points? To answer this question, we study maximal-margin…

Machine Learning · Computer Science 2026-05-25 Kiril Bangachev , Guy Bresler , Jonathan Kogan , Yury Polyanskiy

Let $F$ be a field, and $\mathcal{M}$ be a linear subspace of $n$-by-$n$ matrices with entries in $F$ that have at most two eigenvalues in $F$ (respectively, at most one non-zero eigenvalue in $F$). In a previous article, we have determined…

Rings and Algebras · Mathematics 2026-05-08 Clément de Seguins Pazzis