Related papers: The maximal angle between $3 \times 3$ copositive …

In this paper, we derive in a novel approach the possible textures of neutrino mass matrix that can lead us to maximal atmospheric mixing angle and Dirac CP phase which are consistent with the current neutrino oscillation data. A total of…

We present a polynomial-time $\frac{3}{2}$-approximation algorithm for the problem of finding a maximum-cardinality stable matching in a many-to-many matching model with ties and laminar constraints on both sides. We formulate our problem…

We show that the largest possible diameter $\delta(d,k)$ of a $d$-dimensional polytope whose vertices have integer coordinates ranging between $0$ and $k$ is at most $kd-\lceil2d/3\rceil$ when $k\geq3$. In addition, we show that…

We find exact analytical expressions for mixing angles in matter in the context of three generation neutrino oscillations in matter to discuss the role of resonances in this phenomenon. We show that some knowledge from conventional two…

It follows from known results that every regular tripartite hypergraph of positive degree, with $n$ vertices in each class, has matching number at least $n/2$. This bound is best possible, and the extremal configuration is unique. Here we…

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This last one classifies the case of $a^3b$-quadrilaterals with some irrational angle: there are a sequence of…

In 2010, Mkrtchyan, Petrosyan and Vardanyan proved that every graph $G$ with $2\leq \delta(G)\leq \Delta(G)\leq 3$ contains a maximum matching whose unsaturated vertices do not have a common neighbor, where $\Delta(G)$ and $\delta(G)$…

The main contribution of this paper is a new improved variant of the laser method for designing matrix multiplication algorithms. Building upon the recent techniques of [Duan, Wu, Zhou, FOCS 2023], the new method introduces several new…

In 1959 Fejes T\'oth posed a conjecture that the sum of pairwise non-obtuse angles between $N$ unit vectors in $\mathbb S^d$ is maximized by periodically repeated elements of the standard orthonormal basis. We obtain new improved upper…

In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\phi$ of the semi-random…

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…

Let $A \in {\cal C}^n$ be an extremal copositive matrix with unit diagonal. Then the minimal zeros of $A$ all have supports of cardinality two if and only if the elements of $A$ are all from the set $\{-1,0,1\}$. Thus the extremal…

We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…

Radial Moore graphs and digraphs are extremal graphs related to the Moore ones where the distance-preserving spanning tree is preserved for some vertices. This leads to classify them according to their proximity to being a Moore graph or…

The geometric approach presented in this paper concerns the degree of polarization (DoP) of a random 3D statistical electromagnetic field. We use that a 3*3 coherency matrix can always be decomposed into an incoherent superposition of three…

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…

We prove that if $V=L$ then there is a $\Pi^1_1$ maximal orthogonal (i.e. mutually singular) set of measures on Cantor space. This provides a natural counterpoint to the well-known Theorem of Preiss and Rataj that no analytic set of…

The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max{\binom(3s+2,3), \binom(n,3) - \binom(n-s,3)} for all n,s, n >= 3s+2.

We study the maximal number of pairwise distinct columns in a $\Delta$-modular integer matrix with $m$ rows. Recent results by Lee et al. provide an asymptotically tight upper bound of $O(m^2)$ for fixed $\Delta$. We complement this and…