正弦定理、余弦定理、射影定理的关系分析

三角形的正弦定理、余弦定理、射影定理之间有着内在的关系.在正弦定理不涉及外接圆半径的结论的情形下,三个定理是等价的.余弦定理与射影定理与包含外接圆半径的正弦定理等价.     

微分中值定理的另类证明与推广

通常教科书中,微分中值定理的证明建立在罗尔(Rolle)定理之上.本文以实数连续性中的重要定理———区间套定理为依据,给出了拉格朗日微分中值定理的另类证明.此外,还给出了中值定理的若干推广形式.     

图论中若干重要定理的历史注记

考察了图论中若干重要定理的历史背景,这些定理包括图论基本定理,矩阵-树定理,门格尔定理,霍尔定理,柯尼希定理,塔特定理,彼得森定理,库拉托夫斯基定理,布鲁克斯定理和维津定理.     

播挪运算及其性质

在现有的播挪定义基础上,引入了对偶播挪的概念和任意论域子集族的内并、内交两种新运算,提出了十个定理.它们是：平凡播挪空间定理,最小播挪定理,播挪内运算封闭性定理,播挪任意交定理,播挪上确界定理,播挪运算分配性定理,播挪基判定定理,播挪基闭包定理,播挪基约简定理,播挪基内运算封闭性定理.这些定理对于播挪空间的研究具有一定的理论价值.     

基于可变模糊集的质变与量变定理——兼论集对分析

基于可变模糊集理论中的相对比例函数定义,第一次提出唯物辩证法三大规律之一"质量互变规律"的严密数学定理:质变定理与量变定理.据此提出博弈定理、投票定理.根据提出的这些定理与集对分析的基础概念进行了比较分析.     

一类双调和方程的可解性

利用上下解方法、嵌入定理和Leray-schauder不动点定理证明了一类双调和方程弱解的存在性定理.做为定理的应用,给出了一个实例.     

连续型概率度量的特征及其应用

讨论了连续型概率度量空间,给出了连续型概率度量的特征定理.利用这个特征定理,我们获得了连续型概率度量空间的闭球套定理和M enger空间完备性特征定理.作为本文的应用获得了一个局部概率压缩映象不动点定理.     

一类双调和方程弱解的存在性研究

利用上下解方法、嵌入定理和Leray-Schauder不动点定理证明了一类双调和方程弱解的存在性定理.做为定理的应用,给出了一个实例.     

非紧L-凸度量空间中的GLsKKM定理及其对不动点问题的应用

建立了非紧完备L-凸度量空间中的GLsKKM定理.作为应用,获得了Ky Fan 截口定理,极大元定理和Fan-Browder型不动点定理.     

转移紧开覆盖的新的Ky Fan匹配定理及其对极大元的应用

建立了转移紧开覆盖的两个新的Ky Fan匹配定理.作为应用,获得了新的Fan-Browder重合定理、不动点定理和极大元定理.     

Counterexample to a conjecture of mehta regarding permanental maximization

A counterexample is given for the Mehta conjecture on permanents.     

Orthogonality relations and Cherednik identities for multivariable Baker–Akhiezer functions

We establish orthogonality relations for the Baker–Akhiezer (BA) eigenfunctions of the Macdonald difference operators. We also obtain a version of Cherednik–Macdonald–Mehta integral for these functions. As a corollary, we give a simple derivation of the norm identity and Cherednik–Macdonald–Mehta integral for Macdonald polynomials. In the appendix written by the first author, we prove a summation formula for BA functions. We also consider more general identities of Cherednik type, which we use to introduce and construct more general, twisted BA functions. This leads to a construction of new quantum integrable models of Macdonald–Ruijsenaars type.     

Wahl’s conjecture holds in odd characteristics for symplectic and orthogonal Grassmannians

It is shown that the proof by Mehta and Parameswaran of Wahl’s conjecture for Grassmannians in positive odd characteristics also works for symplectic and orthogonal Grassmannians.      

Vanishing theorems on toric varieties in positive characteristic

We use the liftability of the relative Frobenius morphism of toric varieties and the strong liftability of toric varieties to prove the Bott vanishing theorem, the degeneration of the Hodge to de Rham spectral sequence and the Kawamata–Viehweg vanishing theorem for log pairs on toric varieties in positive characteristic. These results generalize those results of Danilov, Buch–Thomsen–Lauritzen–Mehta, Musta?ǎ and Fujino to the case where concerned Weil divisors are not necessarily torus invariant.     

Fixed Energy Universality for Generalized Wigner Matrices

We prove the Wigner‐Dyson‐Mehta conjecture at fixed energy in the bulk of the spectrum for generalized symmetric and Hermitian Wigner matrices. Previous results concerning the universality of random matrices either require an averaging in the energy parameter or they hold only for Hermitian matrices if the energy parameter is fixed. We develop a homogenization theory of the Dyson Brownian motion and show that microscopic universality follows from mesoscopic statistics.© 2016 Wiley Periodicals, Inc.     

An ordering of dependence for contingency tables

A majorization ordering is defined on matrices with the same row and column sums. This ordering is used as an ordering of dependence for contingency tables. Results are derived for maximal and minimal matrices with respect to the majorization ordering. This theory can be used to maximize and minimize Schur concave functions defined over matrices, when there are row and column sum constraints; in this paper, it is applied to the algorithm of Mehta and Patel (1983) for finding the P-value of Fisher's exact test.     

Homological sections of Lie algebroids

We examine Lie (super)algebroids equipped with a homological section, i.e., an odd section that ‘self-commutes’, we refer to such Lie algebroids as inner Q-algebroids: these provide natural examples of suitably “superised” Q-algebroids in the sense of Mehta. Such Lie algebroids are a natural generalisation of Q-manifolds and Lie superalgebras equipped with a homological element. Amongst other results, we show that, via the derived bracket formalism, the space of sections of an inner Q-algebroid comes equipped with an odd Loday–Leibniz bracket.     

Fast and Accurate Computation of the Exact Confidence Limits for the Common Odds Ratio in Several 2 × 2 Tables

Abstract

Mehta, Patel, and Gray proposed a network algorithm for the exact confidence limits of the common odds ratio in several 2 × 2 tables. Their algorithm was implemented in the StatXact and Egret statistical packages and further discussed by Vollset, Hirji, and Elashoff. The need to evaluate polynomials of potentially very high degrees, however, poses some numerical difficulties. This article presents a method that cuts the degree of polynomials by at least one half. Two other modifications to further stabilize and speed the computation are also proposed.     

Exact Inference for Kendall's S and Spearman's ρ with Extension to Fisher's Exact Test in r × c Contingency Tables

Abstract

We formulate the problem of exact inference for Kendall's S and Spearman's D algebraically, using a general recursion formula developed by Smid for the score S with ties in both rankings. Analogous recursion formulas are shown to hold for the score D as well as for a log transform, F, of the score used in Fisher's exact test of independence in contingency tables. A new implementation of Mehta and Patel's network algorithm is then applied to obtain exact significance levels of either S or D for observations from both continuous and discrete distributions. A simple extension is made to obtain Fisher's exact test in r x c contingency tables. Observed CPU times for contingency table problems four to six of Mehta and Patel and problems four and five of Clarkson, Fan, and Joe are roughly 2/3 of those obtained using Clarkson's et al. implementation of the network algorithm. It is shown that a hierarchy, with F > S > D, holds regarding the rate of aggregation. An algorithm for rapid lexicographic enumeration of entries in a frequency table is also given.