相关论文: The maximal angle between $3 \times 3$ copositive …

A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…

An azimuthal angle correlation between the two hardest jets is studied in the ttbar production process at the 14 TeV LHC. The event samples are generated by merging the tree level matrix elements for the ttbar plus up to 2 or 3 partons with…

P. Erd\H{o}s, J. Pach, R. Pollack, and Z. Tuza [J. Combin. Theory, B 47 (1989), 279--285] made conjectures for the maximum diameter of connected graphs without a complete subgraph $K_{k+1}$, which have order $n$ and minimum degree $\delta$.…

The angle of rotation of any target about the radar line of sight (LOS) is known as the polarization orientation angle. The orientation angle is found to be non-zero for undulating terrains and man-made targets oriented away from the radar…

We define a new class of binary matrices by maximizing the peak-sidelobe distances in the aperiodic autocorrelations. These matrices can be used as robust position marks for in-plane spatial alignment. The optimal square matrices of…

We prove that a maximal surface in Lorentz-Minkowski space $\Bbb L^3$ can be extended analytically along its boundary if the boundary lies in a plane meeting the surface at a constant angle.

A matching is compatible to two or more labeled point sets of size $n$ with labels $\{1,\dots,n\}$ if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to…

Recently, the first author together with Jens Marklof studied generalizations of the classical three distance theorem to higher dimensional toral rotations, giving upper bounds in all dimensions for the corresponding numbers of distances…

In a new application of the discrete non-Abelian symmetry A_4 using the canonical seesaw mechanism, a three-parameter form of the neutrino mass matrix is derived. It predicts the following mixing angles for neutrino oscillations:…

We study maximal estimates for the wave equation with orthonormal initial data. In dimension $d=3$, we establish optimal results with the sharp regularity exponent up to the endpoint. In higher dimensions $d \ge 4$ and also in $d=2$, we…

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.…

In this paper, claims by Lemmens and Seidel in 1973 about equiangular sets of lines with angle $1/5$ are proved by carefully analyzing pillar decompositions, with the aid of the uniqueness of two-graphs on $276$ vertices. The Neumann…

We show that the lower bound for the optimal directional discrepancy with respect to the class of rectangles in $\mathbb{R}^2$ rotated in a restricted interval of directions $[-\theta, \theta]$ with $\theta < \frac{\pi}{4}$ is of the order…

The paper is devoted to studying the orthogonality graph of the matrix ring over a commutative ring. It is proved that the orthogonality graph of the ring of matrices with size greater than 1 over a commutative ring with zero-divisors is…

This paper considers the conjecture by Gr\"unbaum that every planar 3-connected graph has a spanning tree $T$ such that both $T$ and its co-tree have maximum degree at most 3. Here, the co-tree of $T$ is the spanning tree of the dual…

A family of lines through the origin in Euclidean space is called equiangular if any pair of lines defines the same angle. The problem of estimating the maximum cardinality of such a family in $\mathbb{R}^n$ was extensively studied for the…

In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and $n$ additional vertices. In this note, we study how many ways a combinatorial triangulation…

We pose a natural generalization to the well-studied and difficult no-three-in-a-line problem: How many points can be chosen on an $n \times n$ grid such that no three of them form an angle of $\theta$? In this paper, we classify which…

The point sets of all known optimal rectilinear drawings of $K_n$ share an unmistakeable clustering property, the so--called {\em 3--decomposability}. It is widely believed that the underlying point sets of all optimal rectilinear drawings…

Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…