Related papers: Maximal Sets of Equiangular Lines
We present herein a new approach based on the simultaneous application of the deep learning and statistical physics methods to solve the combinatorial optimization problems. The recent modern advanced techniques, such as an artificial…
The maximum independent set problem is a classical NP-hard problem in theoretical computer science. In this work, we study a special case where the family of graphs considered is restricted to intersection graphs of sets of axis-aligned…
Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles in $\mathcal{R}$. In the \emph{max-exposure problem}, given an integer parameter…
In this PhD thesis, several aspects regarding maximal entanglement are analyzed. In the first chapter, Bell Inequalities are analyzed from an operational perspective as well as novel Bell inequalities are obtained together with their…
Recently we gave arguments that only two unique topologically different configurations of 7 equal all mutually touching round cylinders (the configurations being mirror reflections of each other) are possible in 3D, although a whole world…
Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…
Quantum entanglement cannot be unlimitedly shared among arbitrary number of qubits. Larger the number of entangled pairs in an N-qubit system, smaller the degree of bi-partite entanglement is. We analyze a system of N qubits in which an…
Given a bipartite quantum state (in arbitrary dimension) and a decomposition of it as a superposition of two others, we find bounds on the entanglement of the superposition state in terms of the entanglement of the states being superposed.…
We show that the number of lines contained in a supersingular quartic surface is 40 or at most 32, if the characteristic of the field equals 2, and it is 112, 58, or at most 52, if the characteristic equals 3. If the quartic is not…
The maximum cut problem for a quintic del Pezzo surface ${\rm Bl}_{4}(\mathbb{P}^2)$ asks: Among all partitions of the 10 exceptional curves into two disjoint sets, what is the largest possible number of pairwise intersections? In this…
We find the exact size of a maximal non-commuting set in unipotent uppertriangular linear group $UU_4(\mathbb{F}_q)$ in terms of a non-commuting geometric structure (Refer Definition [10]), where $\mathbb{F}_q$ is the finite field with $q$…
Almost $50$ years ago Erd\H{o}s and Purdy asked the following question: Given $n$ points in the plane, how many triangles can be approximate congruent to equilateral triangles? They pointed out that by dividing the points evenly into three…
In this paper, we analyze the structure of maximal sets of $k$-dimensional spaces in $\mathrm{PG}(n,q)$ pairwise intersecting in at least a $(k-2)$-dimensional space, for $3 \leq k\leq n-2$. We give an overview of the largest examples of…
In complex vector spaces maximal sets of equiangular lines, known as SICs, are related to real quadratic number fields in a dimension dependent way. If the dimension is of the form $n^2+3$ the base field has a fundamental unit of negative…
This work considers special types of interval linear systems - overdetermined systems. Simply said these systems have more equations than variables. The solution set of an interval linear system is a collection of all solutions of all…
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…
In this paper, we study the many-to-many matching problem on planar point sets with integer coordinates: Given two disjoint sets $R,B \subset [\Delta]^2$ with $|R|+|B|=n$, the goal is to select a set of edges between $R$ and $B$ so that…
We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…
In this short note we use the polynomial partitioning lemma to strengthen a recent result of Dvir and Gopi about the number of rich lines in high dimensional Euclidean spaces. Our result shows that if there are sufficiently many rich lines…
We study equilibrium configurations of infinitely many identical particles on the real line or finitely many particles on the circle, such that the (repelling) force they exert on each other depends only on their distance. The main question…