Related papers: On the expressive power of Lukasiewicz's square op…
In this paper, we focus on the equivariant inverse Kazhdan--Lusztig polynomials of thagomizer matroids, a natural family of graphic matroids associated with the complete tripartite graphs $K_{1,1,n}$. These polynomials were introduced by…
Let $U$ be a unipotent group which is graded in the sense that it has an extension $H$ by the multiplicative group of the complex numbers such that all the weights of the adjoint action on the Lie algebra of $U$ are strictly positive. We…
The structure of a cubic Lagrangian vertex is clarified for irreducible fields of helicities $s_1, s_2, s_3$ in a $d$-dimensional Minkowski space. An explicit form of the operator $\mathcal{Z}_j$ entering the vertex in a non-multiplicative…
In earlier work, we constructed invariants of irreducible representations of the Kauffman skein algebra of a surface. We introduce here an inverse construction, which to a set of possible invariants associates an irreducible representation…
We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control, PD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PD0L words. We…
We devise calculus rules for the Kurdyka-\L{}ojasiewicz exponent using the rank theorem and Lie group actions. They apply to a wide class of composite and invariant functions, and are particularly suitable for handling nonisolated local…
This paper is devoted to the study of operator-valued Triebel-Lizorkin spaces. We develop some Fourier multiplier theorems for square functions as our main tool, and then study the operator-valued Triebel-Lizorkin spaces on $\mathbb{R}^d$.…
L-convex sets are one of the most fundamental concepts in discrete convex analysis. Furthermore, the Minkowski sum of two L-convex sets, called L2-convex sets, is an intriguing object that is closely related to polymatroid intersection.…
Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas.…
We consider skew-products of quadratic maps over certain Misiurewicz-Thurston maps and study their statistical properties. We prove that, when the coupling function is a polynomial of odd degree, such a system admits two positive Lyapunov…
The space of Schwartz distributions of finite order is represented as a factor space of the space of, what we call, Mikusinski functions. The point of Mikusinski functions is that they admit a multiplication by convergent Laurent series. It…
For each finite, irreducible Coxeter system $(W,S)$, Lusztig has associated a set of "unipotent characters" $\Uch(W)$. There is also a notion of a "Fourier transform" on the space of functions $\Uch(W) \to \RR$, due to Lusztig for Weyl…
In this paper we study the variety of one dimensional representations of a finite $W$-algebra attached to a classical Lie algebra, giving a precise description of the dimensions of the irreducible components. We apply this to prove a…
In this article, we try to formulate a definition of ''many-valued logical structure''. For this, we embark on a deeper study of Suszko's Thesis ($\mathbf{ST}$) and show that the truth or falsity of $\mathbf{ST}$ depends, at least, on the…
We present a hypersequent calculus $\text{G}^3\text{\L}\forall$ for first-order infinite-valued {\L}ukasiewicz logic and for an extension of it, first-order rational Pavelka logic; the calculus is intended for bottom-up proof search. In…
We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…
We study the class structure of finite-alphabet Markov chains with arbitrary memory length. To capture the structural constraints induced by prohibited transitions, we introduce the skeleton of a higher-order transition kernel, defined as a…
Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…
I show that Sudakov resummation takes a particularly transparent form if one deals with the second logarithmic derivative of the short distance coefficient functions for deep inelastic scattering and the Drell-Yan process. A uniquely…
As appropriate generalizations of convex combinations with uncountably many terms, we introduce the so-called Choquet combinations, Choquet decompositions and Choquet convex decompositions, as well as their corresponding hull operators…