Related papers: A syntactical proof of the operational equivalence…
We will prove that the zeta function for Ruelle-expanding maps is rational.
We consider the problem of finding commuting self-adjoint extensions of the partial derivatives {(1/i)(\partial/\partial x_j):j=1,...,d} with domain C_c^\infty(\Omega) where the self-adjointness is defined relative to L^2(\Omega), and…
We present syntactic characterisations for the union closed fragments of existential second-order logic and of logics with team semantics. Since union closure is a semantical and undecidable property, the normal form we introduce enables…
Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states…
The intrinsic treatment of binding in the lambda calculus makes it an ideal data structure for representing syntactic objects with binding such as formulas, proofs, types, and programs. Supporting such a data structure in an implementation…
We study bisimulation and context equivalence in a probabilistic $\lambda$-calculus. The contributions of this paper are threefold. Firstly we show a technique for proving congruence of probabilistic applicative bisimilarity. While the…
In this note, we describe a general procedure to prove functional equations involving quasi-periodic functions. We give novel proofs for fundamental identities of Weierstrass sigma and Jacobi theta functions. Our method is based on the…
We give an introduction to the Mathematica package Lambda, designed for calculating $\lambda$-brackets in both vertex algebras, and in SUSY vertex algebras. This is equivalent to calculating operator product expansions in two-dimensional…
We show that the equational theory of the structure $\langle \omega^{\omega}: (x,y)\mapsto x+y, x\mapsto \omega x \rangle $ is finitely axiomatizable and give a simple axiom schema when the domain is the set of transfinite ordinals. We give…
We exhibit an isomorphism of associative algebras between the $\operatorname{Ext}$-algebra $\operatorname{Ext}_\Lambda^\ast(\Delta,\Delta)$ of standard modules over the dual extension algebra $\Lambda$ of two directed algebras $B$ and $A$…
This note contains a short proof of the functional equation for the zeta function.
We prove two theorems. Theorem 1 gives the meromorphic continuation of the multiple zeta function to the whole space. In Theorem 2, we prove asymptotic behavior near the non-positive integers.
We use the $\mathbb{R}$-linearity of $I\lambda-T$ to define $\sigma(T)$, the right spectrum of a right $\mathbb{H}$-linear operator $T$ in a right quaternionic Hilbert space. We show that $\sigma(T)$ coincides with the $S$-spectrum…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
We define the class of explorable automata on finite or infinite words. This is a generalization of History-Deterministic (HD) automata, where this time non-deterministic choices can be resolved by building finitely many simultaneous runs…
We prove that a certain conjecture holds true and the conjecture states a relationship between the zeta function of a finite category and the Euler characteristic of a finite category.
In the context of the (generalized) Delta Conjecture and its compositional form, D'Adderio, Iraci, and Wyngaerd recently stated a conjecture relating two symmetric function operators, $D_k$ and $\Theta_k$. We prove this Theta Operator…
The definitions and main properties of the Ihara and Bartholdi zeta functions for infinite graphs are reviewed. The general question of the validity of a functional equation is discussed, and various possible solutions are proposed.
This is an ultimate completion of our earlier paper [Acta.\ Math.\ Hungar.\ 140 (2013), 248--292] where mapping properties of several fundamental harmonic analysis operators in the setting of symmetrized Jacobi trigonometric expansions were…
A decidability proof for bisimulation equivalence of first-order grammars (finite sets of labelled rules for rewriting roots of first-order terms) is presented. The equivalence generalizes the DPDA (deterministic pushdown automata)…