Related papers: On the maximum angle between copositive matrices
Let $G$ be an intersection graph of $n$ geometric objects in the plane. We show that a maximum matching in $G$ can be found in $O(\rho^{3\omega/2}n^{\omega/2})$ time with high probability, where $\rho$ is the density of the geometric…
We prove that every graph with maximum degree $\Delta$ admits a partition of its edges into $O(\sqrt{\Delta})$ parts (as $\Delta\to\infty$) none of which contains $C_4$ as a subgraph. This bound is sharp up to a constant factor. Our proof…
For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…
We propose a novel neutrino mixing pattern in terms of only two small integers 1 and 2 together with their square roots and the imaginary number $i$. This ansatz is referred to as the "tetra-maximal" mixing because it can be expressed as a…
Choose $N$ unoriented lines through the origin of ${\bf R}^{d+1}$. The sum of the angles between these lines is conjectured to be maximized if the lines are distributed as evenly as possible amongst the coordinate axes of some orthonormal…
For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…
A longstanding conjecture of Erd\H{o}s and Simonovits states that for every rational $r$ between $1$ and $2$ there is a graph $H$ such that the largest number of edges in an $H$-free graph on $n$ vertices is $\Theta(n^r)$. Answering a…
A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets.…
Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…
It is found that the atmospheric neutrino mixing angle of \theta_{atm} is determined to be \tan\theta_{atm}=Im(B)/Im(C) for B=M_{\nu_e\nu_\mu} and C=M_{\nu_e\nu_\tau}, where M_{ij} is the ij element of M^\dagger_\nu M_\nu with M_\nu as a…
Given a graph $G$, the strong clique number of $G$, denoted $\omega_S(G)$, is the maximum size of a set $S$ of edges such that every pair of edges in $S$ has distance at most $2$ in the line graph of $G$. As a relaxation of the renowned…
The Higgs Triplet Model contains two CP-even neutral scalar eigenstates, each having components from an isospin doublet and an isospin triplet scalar field. The mixing angle can be maximal if the masses of the scalar eigenstates are close…
In 1979, Erd\H{o}s conjectured that if $m = O(n^{2/3})$, then $ex(n, m, \{C_4, C_6 \}) = O(n)$. This conjecture was disproven by several papers and the current best-known bounds for this problem are $$ c_1n^{1 + \frac{1}{15}} \leq ex(n,…
We investigate the renormalization group evolution of masses and mixing angles of Majorana neutrinos under the `High Scale Mixing Unification' hypothesis. Assuming the unification of quark-lepton mixing angles at a high scale, we show that…
Understanding the power of space-bounded computation with access to catalytic space has been an important theme in complexity theory over the recent years. One of the key algorithmic results in this area is that bipartite maximum matching…
Could the location of the maximum point for a positive solution of a semilinear Poisson equation on a convex domain be independent of the form of the nonlinearity? Cima and Derrick found certain evidence for this surprising conjecture. We…
An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…
The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…
In this work, we construct an A4-based flavor symmetry model within the framework of the type-I seesaw mechanism to realize a light neutrino mass matrix consistent with mu-tau reflection symmetry. The entire framework is based on the…
A graph $G$ is terminal-pairable with respect to a demand multigraph $D$ on the same vertex set as $G$, if there exists edge-disjoint paths joining the end vertices of every demand edge of $D$. In this short note, we improve the upper bound…