Related papers: An inversion metric for reduced words
Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…
To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…
The descent algebra of finite Coxeter groups is studied by many famous mathematicians like Bergeron, Brown, Howlett, or Reutenauer. Blessenohl, Hohlweg, and Schocker, for example, proved a symmetry property of the descent algebra, when it…
We derive the explicit formula for the inverse of zeta matrix for any graded posets with the finite set of minimal elements . The combinatorial interpretation of this result is given. For that to do special number theoretic code triangles…
The QED renormalization is restudied by using a mass-dependent subtraction which is performed at a time-like renormalization point. The subtraction exactly respects necessary physical and mathematical requirements such as the gauge…
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…
The QED renormalization is restudied by using a mass-dependent subtraction which is performed at a time-like renormalization point. The subtraction exactly respects necessary physical and mathematical requirements such as the gauge…
Let $(W,S)$ be a Coxeter system and $\Gamma$ be a group of automorphisms of $W$ such that $\gamma(S)=S$ for all $\gamma \in \Gamma$. Then it is known that the group of fixed points $W^\Gamma$ is again a Coxeter group with a canonically…
In this paper, we initiate the study of the twisted weak order associated to a twisted Bruhat order for a Coxeter group and explore the relationship between the lattice property of such order and the infinite reduced words. We show that for…
In this work, we prove a general version of the reduction lemmas for eigenfunctions of graphs admitting involutive automorphisms of a special type.
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
This is the second in a series of papers developing a theory of total positivity for loop groups. In this paper, we study infinite products of Chevalley generators. We show that the combinatorics of infinite reduced words underlies the…
The recently established metric reduction in generalized geometry is encoded in 0-dimensional supersymmetric $\sigma$-models. This is an example of balanced topological field theories. To find the geometric content of such models, the…
In the work of Varchenko, Zagier, Thibon, and Reiner, Saliola, Welker, linear algebraic properties of the multiplication map on the group algebra of the group algebra element are studied, which is the sum over all permutations weighted by…
We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n x n -grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating…
In this paper we prove that if we consider the standard real metric on simplicial rooted trees then the category Tower-Set of inverse sequences can be described by means of the bounded coarse geometry of the naturally associated trees.…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…
Petersen and Tenner defined the depth statistic for Coxeter group elements which, in the symmetric group, can be described in terms of a cost function on transpositions. We generalize that cost function to the other classical (finite and…
We consider a recursive algorithm to construct an aggregated estimator from a finite number of base decision rules in the classification problem. The estimator approximately minimizes a convex risk functional under the l1-constraint. It is…