Related papers: Coxeter-Knuth graphs and a signed Little map for t…
Over the past years, major attention has been drawn to the question of identifying Schur-positive sets, i.e. sets of permutations whose associated quasisymmetric function is symmetric and can be written as a non-negative sum of Schur…
We introduce a bivariant version of the Cuntz semigroup as equivalence classes of order zero maps generalizing the ordinary Cuntz semigroup. The theory has many properties formally analogous to KK-theory including a composition product. We…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…
In this chapter, we give an overview of Billey-Postnikov (BP) decompositions which have become an important tool for understanding the geometry and combinatorics of Schubert varieties. BP decompositions are factorizations of Coxeter group…
This paper is about the Mackey analogy between the tempered representation theory of a real reductive group and that of its Cartan motion group. We consider the embedding of reduced C*-algebras constructed recently in connection with the…
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. By constructing a graph on ribbon…
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove…
To resolve the semantic ambiguity in texts, we propose a model, which innovatively combines a knowledge graph with an improved attention mechanism. An existing knowledge base is utilized to enrich the text with relevant contextual concepts.…
A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed…
We introduce twisted relative Cuntz-Krieger algebras associated to finitely aligned higher-rank graphs and give a comprehensive treatment of their fundamental structural properties. We establish versions of the usual uniqueness theorems and…
This talk was presented at Workshop "Spectral Methods in Representation Theory of Algebras and Applications to the Study of Rings of Singularities", 2008 (Banff, Canada). W. Ebeling established a connection between certain Poincare series,…
We formulate and study the spin nilHecke algebras ${}^\mathfrak{b}\!{\mathrm{NH}}_n^-$ and ${}^\mathfrak{d}\!{\mathrm{NH}}_n^-$ of type B/D, which differ from the usual nilHecke algebras by some odd signs. The type B spin nilHecke algebra…
Patrias and Pylyavskyy introduced shifted Hecke insertion as an application of their theory of dual filtered graphs. We use shifted Hecke insertion to construct symmetric function representatives for the K-theory of the orthogonal…
We introduce a shifted version of the binomial theorem, and use it to study some remarkable trigonometric integrals and their explicit rewriting in terms of binomial multiple sums. Motivated by the expressions of area generating functions…
In this paper, we will introduce notions of relative version of imprimitivity bimodules and relative version of strong Morita equivalence for pairs of $C^*$-algebras $(\mathcal{A}, \mathcal{D})$ such that $\mathcal{D}$ is a $C^*$-subalgebra…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
A graph $G$ with vertex set $V(G)$ and edge set $E(G)$ is said to be word-representable if there exists a word $w$ over the alphabet $V(G)$ such that, for any two distinct letters $x,y \in V(G)$, the letters $x$ and $y$ alternate in $w$ if…
The paper is the sequel to q-alg/9704011. We extend the Drinfeld-Sokolov reduction procedure to q-difference operators associated with arbitrary semisimple Lie algebras. This leads to a new elliptic deformation of the Lie bialgebra…
Given a system of coverings of k-graphs, we show that the cohomology of the resulting (k+1)-graph is isomorphic to that of any one of the k-graphs in the system. We then consider Bratteli diagrams of 2-graphs whose twisted C*-algebras are…