Related papers: From the Lyndon factorization to the Canonical Inv…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
A special Infeld-Hall factorization is given for the Askey-Wilson second order q-difference operator. It is then shown how to deducd a generalization of the corresponding Askey-Wilson polynomials.
We analyze transverse thrust in the framework of Soft Collinear Effective Theory and obtain a factorized expression for the cross section that permits resummation of terms enhanced in the dijet limit to arbitrary accuracy. The factorization…
We obtain a presentation by generators and relations of any Nichols algebra of diagonal type with finite root system. We prove that the defining ideal is finitely generated. The proof is based in Kharchenko's theory of PBW basis of Lyndon…
Type-and-effect systems incorporate information about the computational effects, e.g., state mutation, probabilistic choice, or I/O, a program phrase may invoke alongside its return value. A semantics for type-and-effect systems involves a…
In this article we will apply the first- and second-order supersymmetric quantum mechanics to obtain new exactly-solvable real potentials departing from the inverted oscillator potential. This system has some special properties; in…
Let F be a p-adic field, W_F its absolute Weil group, and let k be an algebraically closed field of prime characteristic l different from p. Attached to any l-adic representation of W_F are local epsilon- and L-factors. There are natural…
Knowing the degree of semantic contrast between words has widespread application in natural language processing, including machine translation, information retrieval, and dialogue systems. Manually-created lexicons focus on opposites, such…
In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a "wide sense"…
We give an explicit geometric argument that Artin's braid group $B_n$ is right-orderable. The construction is elementary, natural, and leads to a new, effectively computable, canonical form for braids which we call left-consistent canonical…
Felty and Miller have described what they claim to be a faithful encoding of the dependently typed lambda calculus LF in the logic of hereditary Harrop formulas, a sublogic of an intuitionistic variant of Church's Simple Theory of Types.…
Given a braided fusion category $C$, it is well known that the natural map $C \boxtimes C^{bop} \to Z(C)$ from the square of $C$ to the (Drinfeld) categorical center $Z(C)$ is an equivalence if and only if $C$ is modular. However, it is not…
An upward (resp. downward) digitally convex word is a binary word that best approximates from below (resp. from above) an upward (resp. downward) convex curve in the plane. We study these words from the combinatorial point of view,…
Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
The representation theorem for odd or even involutive FLe-chains by bunches of layer groups, as discussed in [10], is redefined to demonstrate a more straightforward constructional relationship between odd or even involutive FLe-chains and…
The lack of convergence of the convolution integrals appearing in next-to-leading-power (NLP) factorization theorems prevents the applications of existing methods to resum power-suppressed large logarithmic corrections in collider physics.…
The class of (eventually) dendric words generalizes well-known families such as the Arnoux-Rauzy words or the codings of interval exchanges. There are still many open questions about the link between dendricity and morphisms. In this paper,…
In this article we give two different ways of representations of circular words. Representations with tuples are intended as a compact notation, while representations with trees give a way to easily process all conjugates of a word. The…
Factor complexity $\mathcal{C}$ and palindromic complexity $\mathcal{P}$ of infinite words with language closed under reversal are known to be related by the inequality $\mathcal{P}(n) + \mathcal{P}(n+1) \leq 2 +…