Related papers: Shift equivalence in the generalized factor order
The Rearrangement Conjecture states that if two words over $\mathbb{P}$ are Wilf-equivalent in the factor order on $\mathbb{P}^\ast$ then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove…
Super-strong Wilf equivalence classes of the symmetric group ${\mathcal S}_n$ on $n$ letters, with respect to the generalized factor order, were shown by Hadjiloucas, Michos and Savvidou (2018) to be in bijection with pyramidal sequences of…
The increasing demand for Fourier transforms on geometric algebras has resulted in a large variety. Here we introduce one single straight forward definition of a general geometric Fourier transform covering most versions in the literature.…
We apply general difference calculus in order to obtain solutions to the functional equations of the second order. We show that factorization method can be successfully applied to the functional case. This method is equivariant under the…
Let $P$ be a partially ordered set and consider the free monoid $P^*$ of all words over $P$. If $w,w'\in P^*$ then $w'$ is a factor of $w$ if there are words $u,v$ with $w=uw'v$. Define generalized factor order on $P^*$ by letting $u\le w$…
We present a variation and generalization of a determinant evaluation of Wilf (math.CO/9809120). His result concerns a matrix whose entries are the coefficients of powers of a given power series; we replace the powers by repeated…
In this paper, for a generalised shift operator introduced earlier, we prove theorem of coincidence of classes of functions defined by the order of best approximation by algebraical polynomials and the generalised Lipschitz classes defined…
In this note we propose a generalization of the Laplace and Fourier transforms which we call symmetric Laplace transform. It combines both the advantages of the Fourier and Laplace transforms. We give the definition of this generalization,…
The large variety of Fourier transforms in geometric algebras inspired the straight forward definition of ``A General Geometric Fourier Transform`` in Bujack et al., Proc. of ICCA9, covering most versions in the literature. We showed which…
The goal of this note is to provide a geometric setting in which generalized arithmetic means are best predictors in an appropriate metric. This characterization provides a geometric interpretation to the concept of certainty equivalent.…
In this paper, we generalized the classical Fermat point, proved the sufficient and necessary condition for uniqueness and existence for the generalized Fermat point(GFP) theorem, and discuss some interesting geometric property of the…
We prove a conjecture of Gao and Kitaev on Wilf-equivalence of sets of patterns {12345,12354} and {45123,45213} that extends the list of 10 related conjectures proved in the literature in a series of papers. To achieve our goals, we prove…
These notes are devoted to a detailed exposition of the proof of the Geometric Satake Equivalence for general coefficients, following Mirkovic-Vilonen.
A set of valuable universal similarity factorization equalities are established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…
We give sufficient conditions to find all subtypes isomorphic to a subtype in a finite generalized ordered type.
We prove a general congruence result for bisimilarity in higher-order languages, which generalises previous work to languages specified by a labelled transition system in which programs may occur as labels, and which may rely on operations…
The generalized divided differences are introduced. They are applied to investigate some properties characterizing generalized higher-order convexity. Among others some support-type property is proved.
Kitaev, Liese, Remmel, and Sagan recently defined generalized factor order on words comprised of letters from a partially ordered set $(P, \leq_P)$ by setting $u \leq_P w$ if there is a subword $v$ of $w$ of the same length as $u$ such that…
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…
We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…