Related papers: The maximal angle between $3 \times 3$ copositive …
Analyses of various experimental measurements all indicate that the mixing angle $\theta_{K_1}$ of $K_1(1270)$ and $K_1(1400)$ is in the vicinity of $33^\circ$ or $57^\circ$. However, whether $\theta_{K_1}$ is greater or less than…
Motivated by a question of Erd\"{o}s and inquiries by Beeson and Laczkovich, we explore the possible $N$ for which a triangle $T$ can tile into $N$ congruent copies of a triangle $R$. The \emph{reptile} cases (where $T$ is similar to $R$)…
In this note we address the problem of determining the maximum number of points of intersection of two arithmetically Cohen-Macaulay curves in $\PP^3$. We give a sharp upper bound for the maximum number of points of intersection of two…
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 well-known that every $n$-vertex planar graph with minimum degree 3 has a matching of size at least $\frac{n}{3}$. But all proofs of this use the Tutte-Berge-formula for the size of a maximum matching. Hence these proofs are not…
There has been recent work using Shape Theory to answer the longstanding and conceptually interesting problem of what is the probability that a triangle is obtuse. This is resolved by three kissing cap-circles of rightness being realized on…
The tetra-maximal neutrino mixing pattern predicts a relatively large reactor mixing angle theta_13 \approx 8.4^\circ, which is in good agreement with the latest best-fit value theta_13 = 9^\circ. However, its prediction for theta_12…
In this paper, we show that the maximum number of points in $d\geq3$ dimensions determining exactly 2 distinct triangles is $2d$. We further show that this maximum is uniquely achieved by the vertices of the $d$-orthoplex. We build upon the…
We wish to bring attention to a natural but slightly hidden problem, posed by Erd\H{o}s and Ne\v{s}et\v{r}il in the late 1980s, an edge version of the degree--diameter problem. Our main result is that, for any graph of maximum degree…
We construct a set of points with $\Omega(n^2\log n)$ triples determining an angle $\theta$ whenever $\tan(\theta)$ is algebraic over $\mathbb{Q}$, matching the upper bound of Pach and Sharir. This improves upon the original construction,…
The bounds on the neutrino mixing angles and CP Dirac phase for an SO(10) model with lopsided mass matrices, arising from the presence of ${\bf 16}_H$ and $\bar{\bf 16}_H$ Higgs representations, are studied by variation of the one real and…
We focus in this paper on edge ideals associated to bipartite graphs and give a combinatorial characterization of those having regularity 3. When the regularity is strictly bigger than 3, we determine the first step $i$ in the minimal…
We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…
Let $G=(S, E)$ be a plane straight-line graph on a finite point set $S\subset\R^2$ in general position. The incident angles of a vertex $p \in S$ of $G$ are the angles between any two edges of $G$ that appear consecutively in the circular…
Till 2010 we had three unknown parameters of neutrino oscillation: the third mixing angle {\theta}_(13), the sign of the larger mass difference {\Delta}m^(2)_(31) and the CP violating phase {\delta}. Thanks to a number of consistent…
The systematic large N_c limit within chiral perturbation provides an optimal eta-eta' mixing angle of about -27 degrees at leading order in p^2. In this frame, agreement with the data can be reached with higher order corrections of about…
We study the spectra of mixed graphs about its Hermitian adjacency matrix of the second kind (i.e. N-matrix) introduced by Mohar [1]. We extend some results and define one new Hermitian adjacency matrix, and the entry corresponding to an…
We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…
The maximal contact symmetry dimensions for scalar ODEs of order $\ge 4$ and vector ODEs of order $\ge 3$ are well known. Using a Cartan-geometric approach, we determine for these ODEs the next largest realizable (submaximal) symmetry…
Recent neutrino oscillation data hint that the smallest neutrino mixing angle theta_{13} is possible to lie in the range 5^\circ \lesssim \theta_{13} \lesssim 12^\circ. We show that reasonable perturbations to the democratic mixing pattern,…