English
Related papers

Related papers: Symbolic Protocol Analysis for Diffie-Hellman

200 papers

We present a hierarchical neuro-symbolic control framework that tightly couples a classical symbolic planner with a transformer-based policy to address long-horizon decision-making under uncertainty. At the high level, the planner assembles…

Artificial Intelligence · Computer Science 2025-05-30 Ali Baheri , Cecilia O. Alm

There is a commutative algebra of differential-difference operators, with two parameters, associated to any dihedral group with an even number of reflections. The intertwining operator relates this algebra to the algebra of partial…

Classical Analysis and ODEs · Mathematics 2008-04-24 Charles F. Dunkl

We show how to use extended word series in the reduction of continuous and discrete dynamical systems to normal form and in the computation of formal invariants of motion in Hamiltonian systems. The manipulations required involve complex…

Dynamical Systems · Mathematics 2015-12-01 A. Murua , J. M. Sanz-Serna

A hypergraph consists of a set of nodes along with a collection of subsets of the nodes called hyperedges. Higher-order link prediction is the task of predicting the existence of a missing hyperedge in a hypergraph. A hyperedge…

Machine Learning · Computer Science 2024-12-04 Simon Zhang , Cheng Xin , Tamal K. Dey

A symbolic calculus for a pseudo-differential operators acting on sections of a homogeneous vector bundle over a compact homogeneous space $G/H$ with compact $G$ and $H$ is developed. We realize the symbol of a pseudo-differential operator…

Analysis of PDEs · Mathematics 2019-12-17 Mitsuru Wilson

Systems of differential-algebraic equations (DAEs) are generated routinely by simulation and modeling environments such as Modelica and MapleSim. Before a simulation starts and a numerical solution method is applied, some kind of structural…

Symbolic Computation · Computer Science 2015-05-14 Guangning Tan , Ned S. Nedialkov , John D. Pryce

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

Rings and Algebras · Mathematics 2020-05-12 A. A. Chilikov , A. Ya. Belov

Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic…

Formal Languages and Automata Theory · Computer Science 2024-08-01 Matthew Hague , Artur Jeż , Anthony W. Lin

This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties. Mechanizing the core process algebra in…

Logic in Computer Science · Computer Science 2015-12-24 Timothy Bourke , Robert J. van Glabbeek , Peter Höfner

We first give a condition for a normal operator on a Hilbert space to have no nonzero periodic points, then we give a characterization of normal operators with the whole space as periodic points. We proceed to study the structure of…

Functional Analysis · Mathematics 2025-01-23 Howen Chuah

A new symbol theory for pseudodifferential operators in the complex analytic category is given. This theory provides a cohomological foundation of symbolic calculus.

Analysis of PDEs · Mathematics 2013-08-22 Takashi Aoki , Naofumi Honda , Susumu Yamazaki

We extend the Ruzhansky-Turunen theory of pseudo differential operators on compact Lie groups into a tool that can be used to investigate group-valued Markov processes in the spirit of the work in Euclidean spaces of N.Jacob and…

Probability · Mathematics 2011-01-27 David Applebaum

We present a straightforward, sound Hindley-Milner polymorphic type system for algebraic effects and handlers in a call-by-value calculus, which allows type variable generalisation of arbitrary computations, not just values. This result is…

Programming Languages · Computer Science 2017-04-20 Ohad Kammar , Matija Pretnar

We develop a natural generalization of vector-valued frame theory, we term operator-valued frame theory, using operator-algebraic methods. This extends work of the second author and D. Han which can be viewed as the multiplicity one case…

Functional Analysis · Mathematics 2007-07-24 Victor Kaftal , David Larson , Shuang Zhang

In this paper, we present an algebraic formalism inspired by Butcher's B-series in numerical analysis and the Connes-Kreimer approach to perturbative renormalization. We first define power series of non linear operators and propose several…

High Energy Physics - Theory · Physics 2011-09-15 Thomas Krajewski , Pierre Martinetti

Milner's complete proof system for observational congruence is crucially based on the possibility to equate $\tau$ divergent expressions to non-divergent ones by means of the axiom $recX. (\tau.X + E) = recX. \tau. E$. In the presence of a…

Logic in Computer Science · Computer Science 2023-06-22 Mario Bravetti

In analyses of algorithms, a substantial amount of effort has often to be spent on the discussion of special cases. For example, when the analysis considers the cases X<Y and X>Y separately, one might have to be especially careful about…

Data Structures and Algorithms · Computer Science 2009-11-04 Tobias Jacobs

The weak operator topology closed operator algebra on $L^2(R)$ generated by the one-parameter semigroups for translation, dilation and multiplication by $exp(i\lambda x), \lambda \geq 0$, is shown to be a reflexive operator algebra, in the…

Operator Algebras · Mathematics 2015-03-06 Eleftherios Kastis , Stephen Power

The aim of this article is to give a concise algebraic treatment of the modular symbols formalism, generalised from modular curves to Hecke triangle surfaces. A sketch is included of how the modular symbols formalism gives rise to the…

Number Theory · Mathematics 2007-11-21 Gabor Wiese

The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…

Logic in Computer Science · Computer Science 2012-03-29 Pablo Buiras , Alejandro Díaz-Caro , Mauro Jaskelioff