All Questions
7 questions
3
votes
0
answers
85
views
Exterior powers of the Cartan matrix and Dyck paths
(This question can be formulated purely combinatorially in terms of Dyck paths, which is done in the second part of the question. But I am more interested whether this can be explained by some sort of ...
- 26.5k
7
votes
0
answers
355
views
A homological algebra approach to the Union-closed sets conjecture
I noted a while ago that there is a nice homological formulation using incidence algebra of the Union-closed sets conjecture (https://en.wikipedia.org/wiki/Union-closed_sets_conjecture). It might just ...
- 26.5k
5
votes
0
answers
97
views
Periodics of Coxeter matrices for truncated Nakayama algebras
For $n \geq 3$ and $r \geq 3$ let $C_{n,r}=(c_{i,j})$ denote the $n \times n$-matrix where $c_{i,j}=1$ for $j=i,\dots,i+r-1$ (we only do this until $i+r-1>n$).
So for example for $n=7$ and $r=3$ we ...
- 26.5k
13
votes
1
answer
311
views
Permanent of the Coxeter matrix of a distributive lattice
Let $L$ be a finite distributive lattice with $n$ elements. Let $C=(c_{x,y})$ be the $n \times n$ matrix with entry 1 in case $x \leq y$ and 0 else.
The Coxeter matrix of $L$ is defined as the matrix $...
- 26.5k
7
votes
1
answer
462
views
On a problem for determinants associated to Cartan matrices of certain algebras
This is a continuation of Classification of algebras of finite global dimension via determinants of certain 0-1-matrices but this time with a concrete conjecture and using the simplification suggested ...
- 26.5k
11
votes
2
answers
558
views
Classification of algebras of finite global dimension via determinants of certain 0-1-matrices
I restrict to the elementary problem that is equivalent to give a classification when Morita-Nakayama algebras have finite global dimension (see the end of this post for some background).
A Morita-...
- 26.5k
15
votes
2
answers
860
views
What are the periodic Dyck paths?
I changed the thread completely so that everything is now elementary linear algebra.
A Dyck path of length $n$ is a list of positive integers $[c_1,c_2,...,c_n]$ with $c_i -1 \leq c_{i+1}$ for all $i$...
- 26.5k