We settle a part of the conjecture by Bandini and Valentino [‘On the structure and slopes of Drinfeld cusp forms’, Exp. Math. 31(2) (2022), 637–651] for $S_{k,l}(\Gamma _0(T))$ when $\mathrm {dim}\ S_{k,l}(\mathrm {GL}_2(A))\leq 2$. We frame and check the conjecture for primes $\mathfrak {p}$ and higher levels $\mathfrak {p}\mathfrak {m}$, and show that a part of the conjecture for level $\mathfrak {p} \mathfrak {m}$ does not hold if $\mathfrak {m}\ne A$ and $(k,l)=(2,1)$.

Let A be a semisimple, unital, and complex Banach algebra. It is well known and easy to prove that A is commutative if and only $e^xe^y=e^{x+y}$ for all $x,y\in A$ . Elaborating on the spectral theory of commutativity developed by Aupetit, Zemánek, and Zemánek and Pták, we derive, in this paper, commutativity results via a spectral comparison of $e^xe^y$ and $e^{x+y}$ .

We consider the problem of the unification modulo an equational theory associativity and commutativity (ACh), which consists of a function symbol h that is homomorphic over an associative–commutative operator +. Since the unification modulo ACh theory is undecidable, we define a variant of the problem called bounded ACh unification. In this bounded version of ACh unification, we essentially bound the number of times h can be applied to a term recursively and only allow solutions that satisfy this bound. There is no bound on the number of occurrences of h in a term, and the + symbol can be applied an unlimited number of times. We give inference rules for solving the bounded version of the problem and prove that the rules are sound, complete, and terminating. We have implemented the algorithm in Maude and give experimental results. We argue that this algorithm is useful in cryptographic protocol analysis.

Lange (2000) famously argues that although Jeffrey Conditionalization is non-commutative over evidence, it’s not defective in virtue of this feature. Since reversing the order of the evidence in a sequence of updates that don’t commute does not reverse the order of the experiences that underwrite these revisions, the conditions required to generate commutativity failure at the level of experience will fail to hold in cases where we get commutativity failure at the level of evidence. If our interest in commutativity is, fundamentally, an interest in the order-invariance of information, an updating sequence that does not violate such a principle at the more fundamental level of experiential information should not be deemed defective. This paper claims that Lange’s argument fails as a general defense of the Jeffrey framework. Lange’s argument entails that the inputs to the Jeffrey framework differ from those of classical Bayesian Conditionalization in a way that makes them defective. Therefore, either the Jeffrey framework is defective in virtue of not commuting its inputs, or else it is defective in virtue of commuting the wrong kinds of ones.

It is well-known that some of the most basic properties of words, like the commutativity (xy = yx) and the conjugacy (xz = zy), can be expressed as solutions of word equations. An important problem is to decide whether or not a given equation on words has a solution. For instance, the equation xMyN = zP has only periodic solutions in a free monoid, that is, if xMyN = zP holds with integers m,n,p ≥ 2, then there exists a word w such that x, y, z are powers of w. This result, which received a lot of attention, was first proved by Lyndon and Schützenberger for free groups. In this paper, we investigate equations on partial words. Partial words are sequences over a finite alphabet that may contain a number of “do not know” symbols. When we speak about equations on partial words, we replace the notion of equality (=) with compatibility (↑). Among other equations, we solve xy ↑ yx, xz ↑ zy, and special cases of xmyn ↑ zp for integers m,n,p ≥ 2.