May 21, 2003
Similar papers 3
December 26, 2015
The aim of this paper is to describe all inner and all outer derivations of Leavitt path algebra W(n) via explicit formulas. In fact the space of all inner and all outer derivations of the Leavitt path algebra W(n) has been described.
September 9, 2014
A survey written for the upcoming "Handbook of Enumerative Combinatorics".
May 15, 2010
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We illustrate this approach with applications to moments of orthogonal polynomials, permutations, signed permutations, and tableaux.
February 13, 2009
We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above beginning and ending at the origin. We give an explicit formula for a restricted class of such words using a correspondance between such words and Dyck paths. This explicit formula is exactly the same as that for the degree of the polynomial sati...
February 27, 2013
This paper investigates some combinatorial and algebraic properties of a Witt type formula for graphs.
September 1, 2021
Weighted Leavitt path algebras were introduced in 2013 by Roozbeh Hazrat. These algebras generalise simultaneously the usual Leavitt path algebras and William Leavitt's algebras $L(m,n)$. In this paper we try to give an overview of what is known about the weighted Leavitt path algebras. We also prove some new results (in particular on the graded K-theory of weighted Leavitt path algebras) and mention open problems.
July 4, 2004
The alternating and non-alternating harmonic sums and other algebraic objects of the same equivalence class are connected by algebraic relations which are induced by the product of these quantities and which depend on their index class rather than on their value. We show how to find a basis of the associated algebra. The length of the basis $l$ is found to be $\leq 1/d$, where $d$ is the depth of the sums considered and is given by the 2nd {\sc Witt} formula. It can be also d...
April 9, 2009
The Heisenberg-Weyl algebra, which underlies virtually all physical representations of Quantum Theory, is considered from the combinatorial point of view. We provide a concrete model of the algebra in terms of paths on a lattice with some decomposition rules. We also discuss the rook problem on the associated Ferrers board; this is related to the calculus in the normally ordered basis. From this starting point we explore a combinatorial underpinning of the Heisenberg-Weyl alg...
March 15, 2011
We prove a graph theoretic closed formula for coefficients in the Tian-Yau-Zelditch asymptotic expansion of the Bergman kernel. The formula is expressed in terms of the characteristic polynomial of the directed graphs representing Weyl invariants. The proof relies on a combinatorial interpretation of a recursive formula due to M. Englis and A. Loi.
January 29, 2023
In this paper, we give the structure of free n-Lie algebras. Next, we introduce basic commutators in n-Lie algebras and generalize the Witt formula to calculate the number of the basic commutators. Also, we prove that the set of all of the basic commutators of weight w and length n+(w-2)(n-1) is a basis for Fw, where Fw is the wth term of the lower central series in the free n-Lie algebra F.