相关论文: Coxeter-Knuth graphs and a signed Little map for t…

C*-algebras generalizing Cuntz-Krieger algebras can be associated to hyperbolic homeomorphisms of compact metric spaces. They satisfy a non-commutative form of Spanier-Whitehead duality with respect to K-theory. We prove this for the case…

Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…

In this paper we use theory of embedded graphs on oriented and compact $PL$-surfaces to construct minimal realizations of signed Gauss paragraphs. We prove that the genus of the ambient surface of these minimal realizations can be seen as a…

The quantum Bruhat graph, which is an extension of the graph formed by covering relations in the Bruhat order, is naturally related to the quantum cohomology ring of G/B. We enhance a result of Fulton and Woodward by showing that the…

We develop methods for computing graded K-theory of C*-algebras as defined in terms of Kasparov theory. We establish graded versions of Pimsner's six-term sequences for graded Hilbert bimodules whose left action is injective and by…

In [5], Elnitsky constructed three elegant bijections between classes of reduced words for Type $\mathrm{A}$, $\mathrm{B}$ and $\mathrm{D}$ families of Coxeter groups and certain tilings of polygons. This paper offers a particular…

Knowledge graph embedding techniques are widely used for knowledge graph refinement tasks such as graph completion and triple classification. These techniques aim at embedding the entities and relations of a Knowledge Graph (KG) in a low…

Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes.…

We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…

In this paper we study termination of term graph rewriting, where we restrict our attention to acyclic term graphs. Motivated by earlier work by Plump we aim at a definition of the notion of simplification order for acyclic term graphs. For…

With the aim of completing the previous study by A. Or{\l}owski and the author concerning intertwining maps between induced representations and conjugation representation, termed here weighted class operators, we compute the latter…

This article summarizes joint work with A. Alekseev (Geneva) on the Duflo isomorphism for quadratic Lie algebras. We describe a certain quantization map for Weil algebras, generalizing both the Duflo map and the quantization map for…

Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly…

We give an algebraic proof of the independence of Coxeter moves involved in the construction of positive representations of split-real quantum groups, thus completing a gap in the original construction. To do this, we propose a new…

We prove two extensions of Hansson and Hultman's word property for certain analogues of reduced words associated to twisted involutions in Coxeter groups. Our first extension concerns the superset of such words in which terms with a natural…

This paper examines and strengthens the Cuntz-Thomsen picture of equivariant Kasparov theory for arbitrary second-countable locally compact groups, in which elements are given by certain pairs of cocycle representations between C*-dynamical…

We give an exposition of Schensted's algorithm to find the length of the longest increasing subword of a word in an ordered alphabet, and Greene's generalization of Schensted's results using Knuth equivalence. We announce a generalization…

In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs and power graphs. In both cases we prove a polynomial relation between the treewidth of a graph in the family and…

We show that the noncommutative central limit theorem of Speicher can be adapted to produce the Gaussian statistics associated to Coxeter groups of type B, in the sense of Bo\.zejko, Ejsmont, and Hasebe. Specifically, we show how type B…

The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…