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.     

More on a New Concept of Entropy and Information

An alternative notion of entropy called CRE is proposed in [Ra1] Rao et al. (IEEE Trans. Inf. Theory 50, 2004). This preserves many of the properties of Shannon Entropy and possesses mathematical properties, which we hope will be of use in statistical estimates. In this article, we develop some more mathematical properties of CRE, show its relation to the L log L class, and characterize among others the Weibull distribution.     

二维直方图θ划分最大Shannon熵图像阈值分割

鉴于常用二维直方图区域直分法存在错分,最近提出的斜分法不具普遍性,提出了适用面更广的基于二维直方图θ划分和最大Shannon熵的图像阈值分割算法.首先给出了二维直方图θ划分方法,采用四条平行斜线及一条其法线与灰度级轴成θ角的直线划分二维直方图区域,按灰度级和邻域平均灰度级的加权和进行阈值分割,斜分法可视为该方法中θ=45°的特例;然后导出了二维直方图θ-划分最大Shannon熵阈值选取公式及其快速递推算法;最后给出了θ取不同值时的分割结果及运行时间,θ取较小值时,边界形状准确性较高,θ取较大值时,抗噪性较强,应用时可根据实际图像特点及需求合理选取θ的值.与常规二维直方图直分最大Shannon熵法相比,本文提出的方法所得分割结果更为准确,抵抗噪声更为稳健,且所需运行时间及存储空间也大为减小.     

Real and spurious contributions for the Shannon, Rényi and Tsallis entropies

A two-parameter probability distribution is constructed by dilatation (or contraction) of the escort probability distribution. This transformation involves a physical probability distribution P associated with the system under study and an almost arbitrary reference probability distribution P^′. In contrast to the Shannon and Rényi entropies, the Tsallis entropy does not decompose as the sum of the physical contribution due to P and the reference or spurious part owing to P^′. For solving this problem, a slight modification to the relation between Tsallis and Rényi entropies must be introduced. The procedure in this paper gives rise to a nonconventional one-parameter Shannon entropy and to two-parameter Rényi and Tsallis entropies associated with P. It also contributes to clarify the meaning and role of the escort probabilities set.     

Info-quantifiers’ map-characterization revisited

We highlight the potentiality of a special Information Theory (IT) approach in order to unravel the intricacies of nonlinear dynamics, the methodology being illustrated with reference to the logistic map. A rather surprising dynamic feature→plane-topography map becomes available.     

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.