相关论文: The maximal angle between $3 \times 3$ copositive …
We show that the desirable weak mixing angle sin^2 theta_W = 0.2312 at m_Z scale can be generated naturally in the SU(3)_C times SU(3) model on M^4 times S^1 / (Z_2 times Z_2') where the gauge symmetry SU(3) is broken down to SU(2)_L times…
A tetrahedron is called a path tetrahedron, if it has three mutually orthogonal edges that do not intersect at a single point. A tetrahedron is called a 4-ball tetrahedron, if there exists a sphere tangent to all its edges. We derive…
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…
We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) $n\textrm{-by-}n$ matrix is $\Theta(n^{4/3})$ (resp. $\Theta(n^{3/2}$)). Relationships with point-line incidences in the plane, Bruhat order…
We prove that the number of tangencies between the members of two families, each of which consists of $n$ pairwise disjoint curves, can be as large as $\Omega(n^{4/3})$. We show that from a conjecture about forbidden $0$-$1$ matrices it…
In a graph $G$ of maximum degree $\Delta$ let $\gamma$ denote the largest fraction of edges that can be $\Delta$ edge-coloured. Albertson and Haas showed that $\gamma \geq 13/15$ when $G$ is cubic . We show here that this result can be…
In 2016, Ananyan and Hochster gave the first proof of a positive answer to Stillman's Question, which asked for a bound on the projective dimension of a graded polynomial ideal purely in terms of the number and degrees of its generators.…
Let alpha be an arbitrary angle in a random spherical triangle Delta and a be the side opposite alpha. (The sphere has radius 1; vertices of Delta are independent and uniform.) If some other side is constrained to be pi/2, then…
We use a probabilistic interpretation of solid angles to generalize the well-known fact that the inner angles of a triangle sum to 180 degrees. For the 3-dimensional case, we show that the sum of the solid inner vertex angles of a…
In this article, we mainly give the strictly copositive conditions of a special class of third order three dimensional symmetric tensors. More specifically, by means of the polynomial decomposition method, the analytic sufficient and…
A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We derive new upper bounds on the cardinality of equiangular lines. Let us denote the maximum cardinality of equiangular lines in…
Aougab and Gaster [Math. Proc. Cambridge Philos. Soc. 174 (2023), 569-584] proved that any set of simple closed curves on the torus, where any two are non-homotopic and intersect at most k times, has a maximum size of $k+O(\sqrt{k}\log k)$.…
We propose a new mixing pattern for neutrinos with a nonzero mixing angle $\theta_{13}$. Under a simple form, it agrees well with current neutrino oscillation data and displays a number of intriguing features including the $\mu$-$\tau$…
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…
Given a connected graph $G$ on $n$ vertices, with minimum degree $\delta\geq 2$ and girth at least $g \geq 4$, what is the maximum radius $r$ this graph can have? Erd\H{o}s, Pach, Pollack and Tuza established in the triangle-free case…
From among $ {n \choose 3}$ triangles with vertices chosen from $n$ points in the unit square, let $T$ be the one with the smallest area, and let $A$ be the area of $T$. Heilbronn's triangle problem asks for the maximum value assumed by $A$…
We show that every planar triangulation on $n$ vertices has a maximal independent set of size at most $n/3$. This affirms a conjecture by Botler, Fernandes and Guti\'errez [Electron.\ J.\ Comb., 2024], which in turn would follow if an open…
A strong edge-coloring of a graph $G$ is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most $3$ and the other part is of maximum…
Fine and Gill (1973) introduced the geometric representation for those comparative probability orders on n atoms that have an underlying probability measure. In this representation every such comparative probability order is represented by…
The absolute values of the three degrees of mutual coherence between the analytic signals representing the components of the electric field of a given three-dimensional (3D) polarization state are relative quantities that depend on the…