Related papers: MMS-type problems for Johnson scheme

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

More than twenty-five years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that for positive integers $n,k$ with $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose…

We study nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and the Johnson graphs. For the first eigenvalue we obtain the minimums of $L_{\infty}$-norm for several infinite series of Johnson graphs, including…

In this note, we give short proofs of three theorems concerning extremal problems in the Johnson scheme, or, in other terminology, on $(n,k,L)$-systems. The main result is a proof of the Aljohani--Bamberg--Cameron conjecture which claims…

We study the weights of eigenvectors of the Johnson graphs $J(n,w)$. For any $i \in \{1,\ldots,w\}$ and sufficiently large $n, n\geq n(i,w)$ we show that an eigenvector of $J(n,w)$ with the eigenvalue $\lambda_i=(n-w-i)(w-i)-i$ has at least…

In this paper we give a proof of the Manickam-Mikl\'os-Singhi (MMS) conjecture for some partial geometries. Specifically, we give a condition on partial geometries which implies that the MMS conjecture holds. Further, several specific…

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

We prove a conjecture by Van Dam and Sotirov on the smallest eigenvalue of (distance-$j$) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-$j$) Johnson graphs. More generally, we study the smallest…

The Johnson-Lindenstrauss Lemma states that there exist linear maps that project a set of points of a vector space into a space of much lower dimension such that the Euclidean distance between these points is approximately preserved. This…

We prove a conjecture about the minimal nonnegative solutions of algebraic Riccati equations associated with reducible singular M-matrices. The result enhances our understanding of the behaviour of doubling algorithms for finding the…

We consider the modified Monge-Kantorovich problem with additional restriction: admissible transport plans must vanish on some fixed functional subspace. Different choice of the subspace leads to different additional properties optimal…

We establish lower semi-continuity and strict convexity of the energy functionals for a large class of vector equilibrium problems in logarithmic potential theory. This in particular implies the existence and uniqueness of a minimizer for…

The Manickam-Miklos-Singhi Conjecture states that when n is at least 4k, every multiset of n real numbers with nonnegative total sum has at least (n-1 choose k-1) k-subsets with nonnegative sum. We develop a branch-and-cut strategy using a…

A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…

We are concerned with the dependence of the lowest positive eigenvalue of the Dirac operator on the geometry of rectangles, subject to infinite-mass boundary conditions. We conjecture that the square is a global minimiser both under the…

Subspace segmentation or subspace learning is a challenging and complicated task in machine learning. This paper builds a primary frame and solid theoretical bases for the minimal subspace segmentation (MSS) of finite samples. Existence and…

We address the problem of computing the smallest symplectic eigenvalues and the corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theorem. It is formulated as minimizing a trace cost function…

We prove a quantitative version of the isoperimetric inequality for a non local perimeter of Minkowski type. We also apply this result to study isoperimetric problems with repulsive interaction terms, under convexity constraints. We show…

The multistsochastic Monge--Kantorovich problem on the product $X = \prod_{i=1}^n X_i$ of $n$ spaces is a generalization of the multimarginal Monge--Kantorovich problem. For a given integer number $1 \le k<n$ we consider the minimization…

We develop a numerical method for the martingale analogue of the Benamou--Brenier optimal transport problem, which seeks a martingale interpolating two prescribed marginals which is closest to the Brownian motion. Recent contributions have…