从圆内接三角形面积想到的

首先证明了正三角形的外接椭圆中面积最小的是一个圆.进而用初等方法证明了二维情形的F.John定理.     

Erds-Klamkin不等式的推广(英文)

Erds和Klamkin在1973年建立了如下命题:若A,B,C是一个三角形的内角,λ≥2且0≤μ≤λ,则存在以cos~μ(A/λ),cos~μ(B/λ),cos~μ(C/λ)为边的三角形。本文把μ的范围延拓成0≤μ≤λ~2/2后,证明原结论照样成立。     

Two-generator Discrete Subgroups of Isom(H2) Containing Orientation-reversing Elements

Let f and g be elements of the isometry group Isom(H²) of the hyperbolic plane H², and assume that one of them is orientation-reversing. We determine when the group (f,g) they generate is discrete; in particular, we obtain the classification of such groups. As an application to knot theory, we completely determine the tunnel number one Montesinos knots.     

Extension of Simons' inequality

We prove the following extended version of Simons' inequality and present its applications. Let be a set and be a subset of . Let be a subset of a Hausdorff topological vector space which is invariant under infinite convex combinations. Let be a bounded function such that the functions are convex for all and whenever 0$">, and Let be a sequence in . Assume that, for every , there exists satisfying . Then

If , then the set in the above inequality can be replaced by .

     

Klein polyhedra for three extremal cubic forms

Davenport and Swinnerton-Dyer found the first 19 extremal ternary cubic forms g _i, which have the same meaning as the well-known Markov forms in the binary quadratic case. Bryuno and Parusnikov recently computed the Klein polyhedra for the forms g ₁ – g ₄. They also computed the convergents for various matrix generalizations of the continued fractions algorithm for multiple root vectors and studied their position with respect to the Klein polyhedra. In the present paper, we compute the Klein polyhedra for the forms g ₅, – g ₇ and the adjoint form g ₇ ^* . Their periods and fundamental domains are found and the expansions of the multiple root vectors of these forms by means of the matrix algorithms due to Euler, Jacobi, Poincaré, Brun, Parusnikov, and Bryuno, are computed. The position of the convergents of the continued fractions with respect to the Klein polyhedron is used as a measure of quality of the algorithms. Eulers and Poincarés algorithms proved to be the worst ones from this point of view, and the Bryuno one is the best. However, none of the algorithms generalizes all the properties of continued fractions.Translated from Matematicheskie Zametki, vol. 77, no. 4, 2005, pp. 566–583.Original Russian Text Copyright © 2005 by V. I. Parusnikov.This revised version was published online in April 2005 with a corrected issue number.     

Nature of Nonlocality in Triangle Network based on Elegant Joint Measurement

Defining nonlocality in a no-input closed quantum network scenario is a new area of interest nowadays. Gisin, in [Entropy 21, 325 (2019)], proposed a possible condition for non-tri-locality of the trivial no-input closed network scenario, triangle network, by introducing a new kind of joint measurement bases and a probability bound. In [npj Quantum Information (2020) 6:70] they found a shred of numerical evidence in support of Gisin's probability bound. Now based on that probability bound, it finds the nature of the correlation in a triangle network scenario. This study observes how far the probability lies from that Gisin's bound with every possible combination of entangled and local pure states distributed from three independent quantum sources. Here, it uses the generalized Elegant Joint Measurements bases for each party and find that there is a dependency of non-locality on the entanglement of these joint measurement bases. It also checks the probability bound for the polygon structure.     

Coloring triangle‐free graphs with local list sizes

We prove two distinct and natural refinements of a recent breakthrough result of Molloy (and a follow‐up work of Bernshteyn) on the (list) chromatic number of triangle‐free graphs. In both our results, we permit the amount of color made available to vertices of lower degree to be accordingly lower. One result concerns list coloring and correspondence coloring, while the other concerns fractional coloring. Our proof of the second illustrates the use of the hard‐core model to prove a Johansson‐type result, which may be of independent interest.     

On Schwarzian Triangle Functions,Automorphic Forms and a Generalization of Ramanujan’s Triple Differential Equations

Let G be the group of the fractional linear transformations generated by

$$T(\tau ) = \tau + \lambda ,S(\tau ) = \frac{{\tau \cos \frac{\pi }{n} + \sin \frac{\pi }{n}}}{{ - \tau \sin \frac{\pi }{n} + \cos \frac{\pi }{n}}};$$

where

$$\lambda = 2\frac{{\cos \frac{\pi }{m} + \cos \frac{\pi }{n}}}{{\sin \frac{\pi }{n}}};$$

m, n is a pair of integers with either n ≥ 2,m ≥ 3 or n ≥ 3,m ≥ 2; τ lies in the upper half plane H.

A fundamental set of functions f₀, f_i and f_∞ automorphic with respect to G will be constructed from the conformal mapping of the fundamental domain of G. We derive an analogue of Ramanujan’s triple differential equations associated with the group G and establish the connection of f₀, f_i and f_∞ with a family of hypergeometric functions.     

Chaotic behavior in a new fractional-order love triangle system with competition

In the present work, we first modify the Sprott's nonlinear love triangle model by introducing the competition term and find that the new system also exhibits chaotic behavior. Then, to make the model more realistic, we go further to construct its corresponding fractional-order system and get the necessary condition for the existence of chaotic attractors. Finally, based on an improved version of Adams Bashforth Moulton numerical algorithm, we validate the chaotic attractors of this new fractional-order love triangle system by computer simulations.