๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Proof of a conjecture on immanants of the Jacobi-Trudi matrix

โœ Scribed by Curtis Greene


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
639 KB
Volume
171
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Proof of a conjecture on game domination
โœ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 87 KB ๐Ÿ‘ 1 views

## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume

Proof of a conjecture on Genocchi number
โœ John Riordan; Paul R. Stein ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 446 KB

In [ I ]I, Gandhi has stated the following conjecture on Genocchi numbl:rs: ## . z;(t~-I)~ . The meaning of the odd notation on the 1e:ft of (1) is as follows: write . . . C(k+n-1)2 ; then ## K(n+l,k)=k2K(n,k+lj-(k-l)2~(~~,k~ K(1,k)=k2-(k-1;j2 =2k--1 alId, af course, (1) is restated as (1')

On a conjecture of Aris: Proof and remar
โœ Dan Luss; Neal R. Amundson ๐Ÿ“‚ Article ๐Ÿ“… 1967 ๐Ÿ› American Institute of Chemical Engineers ๐ŸŒ English โš– 428 KB ๐Ÿ‘ 2 views
Proof of a conjecture on fractional Rams
โœ Jason Brown; Richard Hoshino ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 144 KB ๐Ÿ‘ 1 views

## Abstract Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function __r__~__f__~ (__a__~1~, __a__~2~, โ€ฆ, __a__~__k__~) as an extension of the classical definition for Ramsey numbers. They determined an exact formula for the fractional Ramsey function for the case __k__=2. In this

Proof of a conjecture on irredundance pe
โœ Lutz Volkmann; Vadim E. Zverovich ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 157 KB ๐Ÿ‘ 1 views

## Abstract Let __ir__(__G__) and ฮณ(__G__) be the irredundance number and the domination number of a graph __G__, respectively. A graph __G__ is called __irredundance perfect__ if __ir__(__H__)=ฮณ(__H__), for every induced subgraph __H__ of __G__. In this article we present a result which immediatel