Related papers: The Atiyah-Sutcliffe Determinant
Type III methods were introduced by SAS to address difficulties in dummy-variable models for effects of multiple factors and covariates. They are widely used in practice; they are the default method in several statistical computing…
We prove a general quadratic formula for basic hypergeometric series, from which simple proofs of several recent determinant and Pfaffian formulas are obtained. A special case of the quadratic formula is actually related to a Gram…
We introduce a multi-parameter generalization of the Lambda-determinant of Robbins and Rumsey, based on the cluster algebra with coefficients attached to a T-system recurrence. We express the result as a weighted sum over alternating sign…
Thanks to the theory of determinants over an Ore domain, also called Adjamagbo determinant by the Russian school of non commutative algebra, we extend to any Weyl algebra over a field of characteristic zero Suslin theorem solving what…
We prove a conjectured determinantal inequality: \frac{\det J}{\prod_{i=1}^nJ_{ii}}\le 2(1-\frac{1}{n-1})^{n-1}, where $J$ is a real $n\times n$ ($n\ge 2$) diagonally balanced symmetric matrix.
We study conditions under which subdirect products of various types of algebraic structures are finitely generated or finitely presented. In the case of two factors, we prove general results for arbitrary congruence permutable varieties,…
Sharp upper and lower bounds for the second and third order Hermitian-Toepilitz determinants are obtained for some generalized subclasses of starlike and convex functions. Applications of these results are also discussed for several widely…
On a compact oriented surface of genus $g$ with $n\geq 1$ boundary components, $\delta_1, \delta_2,\ldots, \delta_n$, we consider positive factorizations of the boundary multitwist $t_{\delta_1} t_{\delta_2} \cdots t_{\delta_n}$, where…
We treat the problem of normally ordering expressions involving the standard boson operators a, a* where [a,a*]=1. We show that a simple product formula for formal power series - essentially an extension of the Taylor expansion - leads to a…
In previous work we proved that for a SU(2,C) valued loop having the critical degree of smoothness (one half of a derivative in the L^2 Sobolev sense), the following are equivalent: (1) the Toeplitz and shifted Toeplitz operators associated…
We consider a Hankel determinant formula for generic solutions of the Painlev\'e IV equation. We show that the generating functions for the entries of the Hankel determinants are related to the asymptotic solution at infinity of the…
We describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that…
An element a in A_n, the Cayley-Dickson algebra is alternative if (a,a,x)=0 for all x. In this paper we characterise such elements for n>3.To do so,we prove first the so called Yui's conjecture:For a and b pure elements in A_n. If (a,x,b)=0…
Egyptian decompositions of 2/D as a sum of two unit fractions are studied by means of certain divisors of D, namely r and s. Our analysis does not concern the method to find r and s, but just why the scribes have chosen a solution instead…
We consider the general problem of deforming a surjective map of modules $f : E \to F$ over a coproduct sheaf of rings $B=B_1 \otimes_A B_2$ when the domain module $E = B_1 \otimes_A E_2$ is obtained via extension of scalars from a…
We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…
SAS introduced Type III methods to address difficulties in dummy-variable models for effects of multiple factors and covariates. Type III methods are widely used in practice; they are the default method in many statistical computing…
We present a general framework for carrying out some constructions. The unifying factor is a combinatorial principle which we present in terms of a game in which the first player challenges the second player to carry out constructions which…
Given a scheme S and a flat morphism T \to S of finite presentation we define a surjective S-morphism to an {\'e}tale and separated S-scheme, which is universal in an obvious sense. Properties of this morphism are deduced from a thorough…
We develop a simple computational tool for $SU(3)$ analogous to Bargmann's calculus for $SU(2)$. Crucial new inputs are, (i) explicit representation of the Gelfand-Zetlin basis in terms of polynomials in four variables and positive or…