Related papers: Some remarks on permanent dominant conjecture
We propose a conjectural extension to positive characteristic case of a well known Deligne's theorem on the existence of super fiber functors. We prove our conjecture in the special case of semisimple categories with finitely many…
Schoenberg showed that a function $f:(-1,1)\rightarrow \mathbb{R}$ such that $C=[c_{ij}]_{i,j}$ positive semi-definite implies that $f(C)=[f(c_{ij})]_{i,j}$ is also positive semi-definite must be analytic and have Taylor series coefficients…
From a transfer formula in multivariate finite operator calculus, comes an expansion for the determinant similar to Ryser's formula for the permanent. Although this one contains many more terms than the usual determinant formula. To prove…
Vizing's conjecture (open since 1968) relates the product of the domination numbers of two graphs to the domination number of their Cartesian product graph. In this paper, we formulate Vizing's conjecture as a Positivstellensatz existence…
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…
Based on a less-known result, we prove a recent conjecture concerning the determinant of a certain Sylvester-Kac type matrix and consider an extension of it.
We show that a matrix is a Hermitian positive semidefinite matrix whose nonzero entries have modulus 1 if and only if it similar to a direct sum of all $1's$ matrices and a 0 matrix via a unitary monomial similarity. In particular, the only…
The semantics of determiner phrases, be they definite de- scriptions, indefinite descriptions or quantified noun phrases, is often as- sumed to be a fully solved question: common nouns are properties, and determiners are generalised…
We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…
We define the zeta function of a finite category. And we propose a conjecture which states the relationship between the Euler characteristic of finite categories and the zeta function of finite categories. This conjecture is verified when…
We study the class of Hankel matrices for which the $k\times k$-block-matrices are positive semi-definite. We prove that a $k\times k$-block-matrix has non zero determinant if and only if all $k\times k$-block matrices have non zero…
A theorem of Hunter ensures that the complete homogeneous symmetric polynomials of even degree are positive definite functions. A probabilistic interpretation of Hunter's theorem suggests a broad generalization: the construction of…
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving…
The theory of the column-row determinants has been considered for matrices over a non-split quaternion algebra. In this paper the concepts of column-row determinants are extending to a split quaternion algebra. New definitions of the column…
This short note, in part of expository nature, points out several new or recent consequences of a quite nice decomposition for positive semi-definite matrices.
A new family of categorial grammars is proposed, defined by enriching basic categorial grammars with a conjunction operation. It is proved that the formalism obtained in this way has the same expressive power as conjunctive grammars, that…
We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in…