Related papers: Symbolic Protocol Analysis for Diffie-Hellman
Unbounded (and bounded) Toeplitz operators (TO) with rational symbols are analysed in detail showing that they are densely defined closed and have finite dimensional kernels and deficiency spaces. The latter spaces as well as the domains,…
In this letter we develope an operator formalism for the $b-c$ systems with conformal weight $\lambda=1$ defined on a general closed and orientable Riemann surface. The advantage of our approach is that the Riemann surface is represented as…
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the…
This expository article sets forth a self-contained and purely algebraic proof of a deep result of Quillen stating that the category of simplicial commutative algebras over a commutative ring is a model category. This is accomplished by…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
A simple proof is provided to show that any bounded normal operator on a real Hilbert space is orthogonally equivalent to its transpose(adjoint). A structure theorem for invertible skew-symmetric operators, which is analogous to the finite…
We design and analyze new protocols to verify the correctness of various computations on matrices over the ring F[x] of univariate polynomials over a field F. For the sake of efficiency, and because many of the properties we verify are…
A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
Network representations often cannot fully account for the structural richness of complex systems spanning multiple levels of organisation. Recently proposed high-order information-theoretic signals are well-suited to capture synergistic…
The paper considers pseudo-differential boundary value control systems. The underlying operators form an algebra D with the help of which we are able to formulate typical boundary value control problems. The symbolic calculus gives tools to…
We introduce a new symbolic representation based on an original generalization of counter abstraction. Unlike classical counter abstraction (used in the analysis of parameterized systems with unordered or unstructured topologies) the new…
The Dunkl--Dirac operator is a deformation of the Dirac operator by means of Dunkl derivatives. We investigate the symmetry algebra generated by the elements supercommuting with the Dunkl--Dirac operator and its dual symbol. This symmetry…
Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called "iterated…
The Normalization transformation plays a key role in the compilation of Diderot programs. The transformations are complicated and it would be easy for a bug to go undetected. To increase our confidence in normalization part of the compiler…
The classical spectral theorem completely describes self-adjoint operators on finite dimensional inner product vector spaces as linear combinations of orthogonal projections onto pairwise orthogonal subspaces. We prove a similar theorem for…
Let k be an algebraically closed field of characteristic 0 and let D_m be the dihedral group of order 2m with m= 4t, with t bigger than 2. We classify all finite-dimensional Nichols algebras over D_m and all finite-dimensional pointed Hopf…
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be…
In this article we construct the first examples of strongly aperiodic linearly repetitive Delone sets in non-abelian Lie groups by means of symbolic substitutions. In particular, we find such sets in all $2$-step nilpotent Lie groups with…
Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using…