We extend categorical semantics of monadic programming to reversible computing, by considering monoidal closed dagger categories: the dagger gives reversibility, whereas closure gives higher-order expressivity. We demonstrate that Frobenius monads model the appropriate notion of coherence between the dagger and closure by reinforcing Cayley’s theorem; by proving that effectful computations (Kle...

LetM be a smooth oriented manifold. The homology ofM has the structure of a Frobenius algebra. This paper shows that on chain level there is a Frobenius-like algebra structure, whose homology gives the Frobenius algebra of M . Moreover, associated to any Frobeniuslike algebra, there is a chain complex whose homology has the structure of a Gerstenhaber algebra and a Batalin-Vilkovisky algebra. A...

New family of flat potential (Darboux-Egoroff) metrics on the Hurwitz spaces and corresponding Frobenius structures are found. We consider a Hurwitz space as a real manifold. Therefore the number of coordinates is twice as big as the number of coordinates used in the construction of Frobenius manifolds on Hurwitz spaces found by B.Dubrovin more than 10 years ago. The branch points of a ramified...

A first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group K o H such that S = a for some a ∈ K with 〈a〉 = K, where H is of even order or a is an involution. It is known that such graphs admit ‘perfect’ routing and gossiping schemes. A circulant graph is a Cayley graph on a cyclic group of order at least three. Since circulant graphs are widely used as ...

In [1], the multiple Frobenius-Euler numbers and polynomials were constructed. In this paper we give some interesting formulae which are related to the multiple Frobenius-Euler polynomials. The main purpose of this paper is to give the Kummer type congruences for the multiple Frobenius-Euler numbers. §

Iskander Aliev A sharp lower bound for the Frobenius number Ferdinand Georg Frobenius (1849–1917) raised the following problem: given N positive integers a1, . . . , aN with gcd(a1, . . . , aN ) = 1, find the largest natural number gN = gN (a1, . . . , aN) (called the Frobenius

Introduction Lecture 1. Algebraic properties of correlators in 2D topological field theory. Moduli of a 2D TFT and WDVV equations of associativity. Lecture 2. Equations of associativity and Frobenius manifolds. Deformed flat connection and its monodromy at the origin. Lecture 3. Semisimplicity and canonical coordinates. Lecture 4. Classification of semisimple Frobenius manifolds. Lecture 5. Mon...

This is the introductory chapter to this issue. We review the main idea of the localization technique and its brief history both in geometry and in QFT. We discuss localization in diverse dimensions and give an overview of the major applications of the localization calculations for supersymmetric theories. We explain the focus of the present issue.

We establish a new universal relation between the Lie bracket and • –multiplication of tangent fields on any Frobenius (super)manifold. We use this identity in order to introduce the notion of " weak Frobenius manifold " which does not involve metric as part of structure. As another application, we show that the powers of an Euler field generate (a half of) the Virasoro algebra on an arbitrary,...