Related papers: Symbolic Protocol Analysis for Diffie-Hellman
When studying safety properties of (formal) protocol models, it is customary to view the scheduler as an adversary: an entity trying to falsify the safety property. We show that in the context of security protocols, and in particular of…
We prove several results concerning the theory of Toeplitz algebras over $p$-Fock spaces using a correspondence theory of translation invariant symbol and operator spaces. The most notable results are: The full Toeplitz algebra is the norm…
The central open question in Descriptive Complexity is whether there is a logic that characterizes deterministic polynomial time (PTIME) on relational structures. Towards this goal, we define a logic that is obtained from first-order logic…
Symbolic regression, i.e. predicting a function from the observation of its values, is well-known to be a challenging task. In this paper, we train Transformers to infer the function or recurrence relation underlying sequences of integers…
The concept of uniform interpolant for a quantifier-free formula from a given formula with a list of symbols, while well-known in the logic literature, has been unknown to the formal methods and automated reasoning community for a long…
One of the classical notions of group theory is the notion of the exponent of a group. The exponent of a group is the least common multiple of orders of its elements. In this paper we generalize the notion of exponent to Hopf algebras. We…
The Hilbert spaces $\mathscr{H}_{w}$ consisiting of Dirichlet series $F(s)=\sum_{ n = 1}^\infty a_n n^{ -s }$ that satisfty $\sum_{ n=1 }^\infty | a_n |^2/ w_n < \infty$, with $\{w_n\}_n$ of average order $\log_j n$ (the $j$-fold logarithm…
We produce, on general homogeneous groups, an analogue of the usual H\"ormander pseudodifferential calculus on Euclidean space, at least as far as products and adjoints are concerned. In contrast to earlier works, we do not limit ourselves…
Algebraic effects and handlers are a powerful abstraction mechanism to represent and implement control effects. In this work, we study their extension with parametric polymorphism that allows abstracting not only expressions but also…
Iterated applications of belief change operators are essential for different scenarios such as that of ontology evolution where new information is not presented at once but only in piecemeal fashion within a sequence. I discuss iterated…
Dunkl operators for complex reflection groups are defined in this paper. These commuting operators give rise to a parametrized family of deformations of the polynomial De Rham complex. This leads to the study of the polynomial ring as a…
Symbolic algebra relevant to the renormalization of gauge theories can be efficiently performed by machine using modern packages. We devise a scheme for representing and manipulating the objects involved in perturbative calculations of…
We consider composition operators $\mathscr{C}_\varphi$ on the Hardy space of Dirichlet series $\mathscr{H}^2$, generated by Dirichlet series symbols $\varphi$. We prove two different subordination principles for such operators. One…
We prove a cyclic cohomological analogue of Haefliger's van Est-type theorem for the groupoid of germs of diffeomorphisms of a manifold. The differentiable version of cyclic cohomology is associated to the algebra of transverse differential…
Dunkl operators associated with finite reflection groups generate a commutative algebra of differential-difference operators. There exists a unique linear operator called intertwining operator which intertwines between this algebra and the…
We initiate a systematic framework for the analysis of analytic properties of finite Feynman integrals that are multiple polylogarithms. Based on the Feynman parameter representation in complex projective space, we make a complete…
This paper introduces a novel unsupervised learning paradigm inspired by Gerald Edelman's theory of neuronal group selection ("Neural Darwinism"). The presented automaton learns to recognize arbitrary symbols (e.g., letters of an alphabet)…
Several cryptographic protocols constructed based on less-known algorithmic problems, such as those in non-commutative groups, group rings, semigroups, etc., which claim quantum security, have been broken through classical reduction methods…
We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…
For $\alpha \in \mathbb{R}$, let $\mathscr{D}_\alpha$ denote the scale of Hilbert spaces consisting of Dirichlet series $f(s) = \sum_{n=1}^\infty a_n n^{-s}$ that satisfy $\sum_{n=1}^\infty |a_n|^2/[d(n)]^\alpha < \infty$. The…