相关论文: On the maximum angle between copositive matrices

We prove that there is a constant $c >0$, such that whenever $p \ge n^{-c}$, with probability tending to 1 when $n$ goes to infinity, every maximum triangle-free subgraph of the random graph $G_{n,p}$ is bipartite. This answers a question…

We propose a new approach for the study of the quadratic stochastic Euclidean bipartite matching problem between two sets of $N$ points each, $N\gg 1$. The points are supposed independently randomly generated on a domain…

We introduce a new paradigm, $\textit{measure synchronization}$, for synchronizing graphs with measure-valued edges. We formulate this problem as maximization of the cycle-consistency in the space of probability measures over relative…

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…

Contrary to the quark mixing matrix, the lepton mixing matrix could be symmetric. We study the phenomenological consequences of this possibility. In particular, we find that symmetry would imply that |U_{e3}| is larger than 0.16, i.e.,…

We study the origin of neutrino masses and mixing angles which can accomodate the LMA MSW solutions of the solar neutrino anomaly as well as the solution of the atmospheric neutrino problem, within the framework of the see-saw mechanism. We…

We study the equivalence between bipartiteness and symmetry of spectra of mixed graphs, for $\theta$-Hermitian adjacency matrices defined by an angle $\theta \in (0, \pi]$. We show that this equivalence holds when, for example, an angle…

We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…

Several upper and lower bounds for the numerical radius of $2 \times 2$ operator matrices are developed which refine and generalize the earlier related bounds. In particular, we show that if $B,C$ are bounded linear operators on a complex…

The \emph{minimum positive co-degree} $\delta^{+}_{r-1}(H)$ of a non-empty $r$-graph $H$ is the maximum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of $H$, then $S$ is contained in at least $k$ hyperedges of $H$. For any…

A graph is said to be diameter-$k$-critical if its diameter is $k$ and removal of any of its edges increases its diameter. A beautiful conjecture by Murty and Simon, says that every diameter-2-critical graph of order $n$ has at most…

A classic result in extremal graph theory, known as Mantel's theorem, states that every non-bipartite graph of order $n$ with size $m>\lfloor \frac{n^{2}}{4}\rfloor$ contains a triangle. Lin, Ning and Wu [Comb. Probab. Comput. 30 (2021)…

We study the diametric problem (i.e., optimal anticodes) in the space of permutations under the Ulam distance. That is, let $S_n$ denote the set of permutations on $n$ symbols, and for each $\sigma, \tau \in S_n$, define their Ulam distance…

An old problem raised independently by Jacobson and Sch\"onheim asks to determine the maximum $s$ for which every graph with $m$ edges contains a pair of edge-disjoint isomorphic subgraphs with $s$ edges. In this paper we determine this…

Nonzero and relatively large of $\theta_{13}$ mixing angle has some phenomenological consequences on neutrino physics beyond the standard model. One of the consequences if the mixing angle $\theta_{13}\neq 0$ is the possibility of the CP…

We give the maximal distance between a copula and itself when the argument is permuted for arbitrary dimension, generalizing a result for dimension two by Nelsen (2007), Klement and Mesiar (2006). Furthermore, we establish a subset of…

We study the maximum number of straight-line segments connecting $n$ points in convex position in the plane, so that each segment intersects at most $k$ others. This question can also be framed as the maximum number of edges of an outer…

The problem of finding a maximum $2$-matching without short cycles has received significant attention due to its relevance to the Hamilton cycle problem. This problem is generalized to finding a maximum $t$-matching which excludes specified…

In this paper, we consider maximum possible value for the sum of cardinalities of hyperedges of a hypergraph without a Berge $4$-cycle. We significantly improve the previous upper bound provided by Gerbner and Palmer. Furthermore, we…

We introduce a new index of the leptonic CP phase dependence $I_{\rm CP}$ and derive the maximal condition for this index in a simple and general form. $I_{\rm CP}\simeq 100%$ may be realized even in the JPARC experiment. In the case that…