Related papers: Symbolic Protocol Analysis for Diffie-Hellman
A recursion operator is an integro-differential operator which maps a generalized symmetry of a nonlinear PDE to a new symmetry. Therefore, the existence of a recursion operator guarantees that the PDE has infinitely many higher-order…
In the research on computational effects, defined algebraically, effect symbols are often expected to obey certain equations. If we orient these equations, we get a rewrite system, which may be an effective way of transforming or optimizing…
We consider the model of population protocols introduced by Angluin et al., in which anonymous finite-state agents stably compute a predicate of the multiset of their inputs via two-way interactions in the all-pairs family of communication…
Given a renormalizable theory we construct the dilatation operator, in the sense of generator of RG flow of composite operators. The generator is found as a differential operator acting on the space of normal symbols of composite operators…
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics…
We introduce an algebraic analogue of dynamical systems, based on term rewriting. We show that a recursive function applied to the output of an iterated rewriting system defines a formal class of models into which all the main architectures…
Algorithm extraction aims to synthesize executable programs directly from models trained on algorithmic tasks, enabling de novo algorithm discovery without relying on human-written code. However, applying this paradigm to Transformer is…
We construct an algebra of pseudodifferential operators on each groupoid in a class that generalizes differentiable groupoids to allow manifolds with corners. We show that this construction encompasses many examples. The subalgebra of…
Error: Peer-review process exposed an error in Theorem 1 that, unfourtunately, is not repairable. Idempotent semigroups are always finite. See Green and Rees [1952], Siekmann and Szab\'o [1981] for details Anti-unification is a fundamental…
In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem efficiently if the group order is known and has no large prime factors. The consequence is that such groups are avoided.…
Rewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in which widely different logics can be specified. Maude programs are exactly rewrite…
Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…
Bilinear pseudodifferential operators with symbols in the bilinear analog of all the H\"ormander classes are considered and the possibility of a symbolic calculus for the transposes of the operators in such classes is investigated. Precise…
Currently there is an active Post-Quantum Cryptography (PQC) solutions search, which attempts to find cryptographic protocols resistant to attacks by means of for instance Shor polynomial time algorithm for numerical field problems like…
We characterize symbolic powers of prime ideals in polynomial rings over any field in terms of $\mathbb{Z}$-linear differential operators, and of prime ideals in polynomial rings over complete discrete valuation rings with a $p$-derivation…
Using Dunkl operators, we introduce a continuous family of canonical invariants of finite reflection groups. We verify that the elementary canonical invariants of the symmetric group are deformations of the elementary symmetric polynomials.…
We introduce an abstract theory of the principal symbol mapping for pseudodifferential operators extending the results of a preceding paper and providing a simple algebraic approach to the theory of pseudodifferential operators in settings…
When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to solve the nondeterminism. It has been observed that for certain…
We consider bilinear pseudo-differential operators whose symbols posses Gevrey type regularity and may have a sub-exponential growth at infinity, together with all their derivatives. It is proved that those symbol classes can be described…
I give a new derivation of the Explicit Formula for an arbitrary number field and abelian Dirichlet-Hecke character, which treats all primes in exactly the same way, whether they are discrete or archimedean, and also ramified or not. This…