相关论文: Flag weak order on wreath products
The shard intersection order is a new lattice structure on a finite Coxeter group W which encodes the geometry of the reflection arrangement and the lattice theory of the weak order. In the case where W is the symmetric group, we…
It is known that the behavior of the Mitchell order substantially changes at the level of rank-to-rank extenders, as it ceases to be well-founded. While the possible partial order structure of the Mitchell order below rank-to-rank extenders…
Let $R$ be a $G$-graded ring. In this article, we introduce two new concepts on graded rings, namely, weakly graded rings and invertible graded rings, and we discuss the relations between these concepts and several properties of graded…
Let (G,S) be a Coxeter group. We construct a continuation, to the open unit disc, of the unitary representations associated to the positive definite functions g -> r^l(g). (Here 0<r<1, and l denotes the length function with respect to the…
The objective of this paper is to study the monoid of all partial transformations of a finite set that preserve a uniform partition. In addition to proving that this monoid is a quotient of a wreath product with respect to a congruence…
We calculate the rate of thermal Schwinger pair production at arbitrary coupling in weak external fields. Our calculations are valid independently of many properties of the charged particles produced, in particular their spin and whether…
In this work we study a weak order ideal associated with the coset leaders of a non-binary linear code. This set allows the incrementally computation of the coset leaders and the definitions of the set of leader codewords. This set of…
We develop a formal theory of the weak values with emphasis on the consistency conditions and a probabilistic interpretation in the counter-factual processes. We present the condition for the choice of the post-selected state to give a…
This paper considers a finite group $G$ acting linearly on the variables $V$ of a polynomial algebra, or an exterior algebra, or superpolynomial algebra with both commuting and anticommuting variables. In this setting, the Hilbert series…
We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…
The concept of a weak factorization system has been studied extensively in homotopy theory and has recently found an application in one of the proofs of the celebrated flat cover conjecture, categorical versions of which have been presented…
We study linear orderings expanded by functions for successor and predecessor. The successor and predecessor on linear orderings capture the relatively intrinsically computably enumerable information about orderings in much the same way…
Given a permutational wreath product sequence of cyclic groups we investigate its minimal generating set, minimal generating set for its commutator and some properties of its commutator subgroup. We strengthen the result of author…
We use the lens of Zappa--Sz\'ep decomposition to examine the relationship between directed graph products and $k$-graph products. There are many examples of higher-rank graphs, or $k$-graphs, whose underlying directed graph may be factored…
The width of a well partial ordering (wpo) is the ordinal rank of the set of its antichains ordered by inclusion. We compute the width of wpos obtained as cartesian products of finitely many well-orderings.
Let A be any set of positive integers and n a positive integer. A composition of n with parts in A is an ordered collection of one or more elements in A whose sum is n. We derive generating functions for the number of compositions of n with…
Let $G$ be an irreducible imprimitive subgroup of $\operatorname{GL}_n(\mathbb{F})$, where $\mathbb{F}$ is a field. Any system of imprimitivity for $G$ can be refined to a nonrefinable system of imprimitivity, and we consider the question…
We consider the problem of partial order production: arrange the elements of an unknown totally ordered set T into a target partially ordered set S, by comparing a minimum number of pairs in T. Special cases include sorting by comparisons,…
In this paper we define a generating function for buildings of type $\widetilde{A}_1$ (i.e. trees) that are enhanced with a certain filtration structure. We prove that this generating function recovers the zeta function of certain quadratic…
In this article we develop a notion of soficity for actions of countable groups on sets. We show two equivalent perspectives, several natural properties and examples. Notable examples include arbitrary actions of both amenable groups and…