相关论文: The Strong Macdonald Conjecture

We demonstrate the validity of previously conjectured explicit expressions for the norm and the evaluation of the Macdonald polynomials in superspace. These expressions, which involve the arm-lengths and leg-lengths of the cells in certain…

This paper presents a summary of the current status of determinations of the strong coupling constant alpha_s. A detailed description of the definition, scale dependence and inherent theoretical ambiguities is given. The various physical…

For a continuous flow on a compact metric space, the aim of this paper is to prove a Conley-type decomposition of the strong chain recurrent set. We first discuss in details the main properties of strong chain recurrent sets. We then…

We prove the $p$-part of the strong Stark conjecture for every totally odd character and every odd prime $p$. Let $L/K$ be a finite Galois CM-extension with Galois group $G$, which has an abelian Sylow $p$-subgroup for an odd prime $p$. We…

In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.

In this paper we investigate some strong convergence theorems for partial sums with respect to Vilenkin system.

We prove a logical implication between two old conjectures stated by Bapat and Sunder about the permanent of positive semidefinite matrices. Although Drury has recently disproved both conjectures, this logical implication yields a…

A multivariable hypergeometric-type formula for raising operators of the Macdonald polynomials is conjectured. It is proved that this agrees with Jing and Jozefiak's expression for the two-row Macdonald polynomials, and also with Lassalle…

We prove the Martingale Convergence Theorem by using the work of L. Dubins and I. Monroe about embedding a given discrete-time martingale in the sample paths of a Brownian motion.

We formulate a stable reduction conjecture that extends Deligne-Mumford's stable reduction to higher dimensions and provide a simple proof that it holds in large characteristic, assuming two standard conjectures of the Minimal Model…

The aim of this article is to simplify Pfanzagl's proof of consistency for asymptotic maximum likelihood estimators, and to extend it to more general asymptotic M-estimators. The method relies on the existence of a sort of contraction of…

We give a new proof of the Mordell-Lang conjecture in positive characteristic for finitely generated subgroups. We also make some progress towards the full Mordell-Lang conjecture in positive characteristic.

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

We introduce a new operator $\Gamma$ on symmetric functions, which enables us to obtain a creation formula for Macdonald polynomials. This formula provides a connection between the theory of Macdonald operators initiated by Bergeron,…

In this paper, authors study the convexity and concavity properties of real-valued function with respect to the classical means, and prove a conjecture posed by Bruce Ebanks in \cite{e}.

In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…

We survey most of the known results concerning the Eisenbud-Green-Harris Conjecture. Our presentation includes new proofs of several theorems, as well as a unified treatment of many results which are otherwise scattered in the literature.…

We formulate a conjecture which generalizes Darmon's "refined class number formula". We discuss relations between our conjecture and the equivariant leading term conjecture of Burns. As an application, we give another proof of the "except…

We prove the Banach strong Novikov conjecture for groups having polynomially bounded higher-order combinatorial functions. This includes all automatic groups.

In a recent paper, Park and Pham famously proved Kahn-Kalai conjecture. In this note, we simplify their proof, using an induction to replace the original analysis. This reduces the proof to one page, and from the argument it is also easy to…