Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of universal algebra, such as theories of symmetric operads, non-symmetric operads, generalised operads, PROPs, PROs, and monads. These variants of universal algebra are called notions of algebraic theory. In this paper, we develop a unified framework for them. The key observation is that each notion of algebraic theory can be identified with a monoidal category, in such a way that algebraic theories correspond to monoid objects therein. To incorporate semantics, we introduce a categorical structure called metamodel, which formalises a definition of models of algebraic theories. We also define morphisms between notions of algebraic theory, which are a monoidal version of profunctors. Every strong monoidal functor gives rise to an adjoint pair of such morphisms, and provides a uniform method to establish isomorphisms between categories of models in different notions of algebraic theory. A general structure-semantics adjointness result and a double categorical universal property of categories of models are also shown.
The papers by Curien @cite_6 and Hyland @cite_15 concentrate on clones, symmetric operads and non-symmetric operads, and concern primarily the conceptual understanding of the substitution monoidal structures. Via the theory of pseudo-distributive laws @cite_19 , they reduce substitution monoidal structures to certain 2-monads on @math , for example the free cartesian category 2-monad in the case of clones. Their work illuminates the relationship between the notions of algebraic theory they treat and their standard metamodels, because the standard metamodels arise as Eilenberg--Moore algebras of the 2-monad from which the corresponding substitution monoidal structure is induced. On the other hand, monads and generalised operads do not seem to be captured by their framework.
@cite_19 @cite_15 @cite_6
2040355822 2215703121 2100098955 2043706520 2089729462 2087185080 2010907903 1597381512 2137258051 230449344 1601458080 2136727539 2550342065 2409645877 2154483904 2114991657 2613622891 2106856555 1921398896 1988961015
We give a general category theoretic formulation of the substitution structure underlying the category theoretic study of variable binding proposed by Fiore, Plotkin, and Turi. This general formulation provides the foundation for their work on variable binding, as well as Tanaka's linear variable binding and variable binding for other binders and for mixtures of binders as for instance in the Logic of Bunched Implications. The key structure developed by was a substitution monoidal structure, from which their formulation of binding was derived; so we give an abstract formulation of a substitution monoidal structure, then, at that level of generality, derive the various category theoretic structures they considered. The central construction we use is that of a pseudo-distributive law between 2-monads on Cat, which suffices to induce a pseudo-monad on Cat, and hence a substitution monoidal structure on the free object on 1. We routinely generalise that construction to account for types. Whereas formal category theory is classically considered within a @math -category, in this paper a double-dimensional approach is taken. More precisely we develop such theory within the setting of hypervirtual double categories, a notion extending that of virtual double category by adding cells with nullary target. [...] After this the notion of weak' Kan extension within a hypervirtual double category is considered, together with three strengthenings. [...] The notion of yoneda embedding is then considered in a hypervirtual double category, and compared to that of a good yoneda structure on a @math -category; the latter in the sense of Street-Walters and Weber. Conditions are given ensuring that a yoneda embedding @math defines @math as the free small cocompletion of @math , in a suitable sense. In the second half we consider formal category theory in the presence of algebraic structures. In detail: to a monad @math on a hypervirtual double category @math several hypervirtual double categories @math of @math -algebras are associated, [...]. This is followed by the study of the creation of, amongst others, left Kan extensions by the forgetful functors @math . The main motivation of this paper is the description of conditions ensuring that yoneda embeddings in @math lift along these forgetful functors, as well as ensuring that such lifted algebraic yoneda embeddings again define free small cocompletions, now in @math . As a first example we apply the previous to monoidal structures on categories, hence recovering Day convolution of presheaves and Im-Kelly's result on free monoidal cocompletion, as well as obtaining a "monoidal Yoneda lemma". We study Kan extensions in three weakenings of the Eilenberg-Moore dou- ble category associated to a double monad, that was introduced by Grandis and Par e. To be precise, given a normal oplax double monad T on a double categoryK, we consider the double categories consisting of pseudo T -algebras, 'weak' vertical T -morphisms, hor- izontal T -morphisms and T -cells, where 'weak' means either 'lax', 'colax' or 'pseudo'. Denoting these double categories by Algw(T ), where w = l, c or ps accordingly, our main result gives, in each of these cases, conditions ensuring that (pointwise) Kan extensions can be lifted along the forgetful double functor Algw(T ) ! K. As an application we recover and generalise a result by Getzler, on the lifting of pointwise left Kan extensions along symmetric monoidal enriched functors. As an application of Getzler's result we prove, in suitable symmetric monoidal categories, the existence of bicommutative Hopf monoids that are freely generated by cocommutative comonoids. I describe the noncommutative Batalin-Vilkovisky geometry as- sociated naturally with arbitrary modular operad. The classical limit of this geometry is the noncommutative symplectic geometry of the corresponding tree-level cyclic operad. I show, in particular, that the algebras over the Feyn- man transform of a twisted modular operad P are in one-to-one correspondence with solutions to quantum master equation of Batalin-Vilkovisky geometry on the affineP manifolds. As an application I give a construction of character- istic classes with values in the homology of the quotient of Deligne-Mumford moduli spaces. These classes are associated naturally with solutions to the quantum master equation on affineS(t) manifolds, where S(t) is the twisted modular Det operad constructed from symmetric groups, which generalizes the cyclic operad of associative algebras. A number of recent results on optimization problems involving submodular functions have made use of the "multilinear relaxation" of the problem. We present a general approach to deriving inapproximability results in the value oracle model, based on the notion of "symmetry gap". Our main result is that for any fixed instance that exhibits a certain "symmetry gap" in its multilinear relaxation, there is a naturally related class of instances for which a better approximation factor than the symmetry gap would require exponentially many oracle queries. This unifies several known hardness results for submodular maximization, e.g. the optimality of (1-1 e)-approximation for monotone submodular maximization under a cardinality constraint, and the impossibility of (1 2+epsilon)-approximation for unconstrained (non-monotone) submodular maximization. It follows from our result that (1 2+epsilon)-approximation is also impossible for non-monotone submodular maximization subject to a (non-trivial) matroid constraint. On the algorithmic side, we present a 0.309-approximation for this problem, improving the previously known factor of 1 4-o(1).As another application, we consider the problem of maximizing a non-monotone submodular function over the bases of a matroid. A (1 6-o(1))-approximation has been developed for this problem, assuming that the matroid contains two disjoint bases. We show that the best approximation one can achieve is indeed related to packings of bases in the matroid. Specifically, for any k≫=2, there is a class of matroids of fractional base packing number nu = k (k-1), such that any algorithm achieving a better than (1-1 nu)-approximation for this class would require exponentially many value queries. On the positive side, we present a 1 2 (1-1 nu-o(1))-approximation algorithm for the same problem. Our hardness results hold in fact for very special symmetric instances. For such symmetric instances, we show that the approximation factors of 1 2 (for submodular maximization subject to a matroid constraint) and 1-1 nu (for a matroid base constraint) can be achieved algorithmically and hence are optimal. We give a category-theoretic formulation of Engeler-style models for the untyped λ-calculus. In order to do so, we exhibit an equivalence between distributive laws and extensions of one monad to the Kleisli category of another and explore the example of an arbitrary commutative monad together with the monad for commutative monoids. On Set as base category, the latter is the finite multiset monad. We exploit the self-duality of the category Rel, i.e., the Kleisli category for the powerset monad, and the category theoretic structures on it that allow us to build models of the untyped λ-calculus, yielding a variant of the Engeler model. We replace the monad for commutative monoids by that for idempotent commutative monoids, which, on Set, is the finite powerset monad. This does not quite yield a distributive law, so requires a little more subtlety, but, subject to that subtlety, it yields exactly the original Engeler construction. Fusion laws permit to eliminate various of the intermediate data structures that are created in function compositions. The fusion laws associated with the traditional recursive operators on datatypes cannot, in general, be used to transform recursive programs with effects. Motivated by this fact, this paper addresses the definition of two recursive operators on datatypes that capture functional programs with effects. Effects are assumed to be modeled by monads. The main goal is thus the derivation of fusion laws for the new operators. One of the new operators is called monadic unfold. It captures programs (with effects) that generate a data structure in a standard way. The other operator is called monadic hylomorphism, and corresponds to programs formed by the composition of a monadic unfold followed by a function defined by structural induction on the data structure that the monadic unfold generates. For a graph G, we construct two algebras whose dimensions are both equal to the number of spanning trees of G. One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of the polynomial ring modulo certain powers of linear forms. We describe the set of monomials that forms a linear basis in each of these two algebras. The basis elements correspond to G-parking functions that naturally came up in the abelian sandpile model. These ideals are instances of the general class of monotone monomial ideals and their deformations. We show that the Hilbert series of a monotone monomial ideal is always bounded by the Hilbert series of its deformation. Then we define an even more general class of monomial ideals associated with posets and construct free resolutions for these ideals. In some cases these resolutions coincide with Scarf resolutions. We prove several formulas for Hilbert series of monotone monomial ideals and investigate when they are equal to Hilbert series of deformations. In the appendix we discuss the abelian sandpile model. We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differential equations with multivariate polynomial right-hand sides. Our approach casts the problem of generating invariants for differential equations as the greatest fixed point of a monotone operator over the lattice of ideals in a polynomial ring. We provide an algorithm to compute this monotone operator using basic ideas from commutative algebraic geometry. However, the resulting iteration sequence does not always converge to a fixed point, since the lattice of ideals over a polynomial ring does not satisfy the descending chain condition. We then present a bounded-degree relaxation based on the concept of "pseudo ideals", due to Colon, that restricts ideal membership using multipliers with bounded degrees. We show that the monotone operator on bounded degree pseudo ideals is convergent and generates fixed points that can be used to generate useful algebraic invariants for non-linear systems. The technique for continuous systems is then extended to consider hybrid systems with multiple modes and discrete transitions between modes. We have implemented the exact, non-convergent iteration over ideals in combination with the bounded degree iteration over pseudo ideals to guarantee convergence. This has been applied to automatically infer useful and interesting polynomial invariants for some benchmark non-linear systems. Let ( O ) k be the ring of integers of a finite extension k of the field ( Q ) p of p-adic numbers. The endomorphisms of a formal group law defined over ( O ) k provide nontrivial examples of commuting formal series with coefficients in ( O ) k . This article deals with the inverse problem formulated by Jonathan Lubin within the context of non-Archimedean dynamical systems. We present a large family of series, with coefficients in ( Z ) p , which satisfy Lubin's conjecture. These series are constructed with the help of Lubin–Tate formal group laws over ( Q ) p . We introduce the notion of minimally ramified series which turn out to be modulo p reductions of some series of this family. The commutant monoids of these minimally ramified series are determined by using the Fontaine–Wintenberger theory of the field of norms which allows an interpretation of them as automorphisms of ( Z ) p -extensions of local fields of characteristic zero. A particularly effective example illustrating the paper is given by a family of series generalizing Cebysev polynomials Rewriting logic extends to concurrent systems with state changes the body of theory developed within the algebraic semantics approach. It is both a foundational tool and the kernel language of several implementation efforts (Cafe, ELAN, Maude). Tile logic extends (unconditional) rewriting logic since it takes into account state changes with side effects and synchronization. It is especially useful for defining compositional models of computation of reactive systems, coordination languages, mobile calculi, and causal and located concurrent systems. In this paper, the two logics are defined and compared using a recently developed algebraic specification methodology, membership equational logic. Given a theory T, the rewriting logic of T is the free monoidal 2-category, and the tile logic of T is the free monoidal double category, both generated by T. An extended version of monoidal 2-categories, called 2VH-categories, is also defined, able to include in an appropriate sense the structure of monoidal double categories. We show that 2VH-categories correspond to an extended version of rewriting logic, which is able to embed tile logic, and which can be implemented in the basic version of rewriting logic using suitable internal strategies. These strategies can be significantly simpler when the theory is uniform. A uniform theory is provided in the paper for CCS, and it is conjectured that uniform theories exist for most process algebras. Recently an orthogonal basis ofWN -algebra (AFLT basis) labeled by N-tuple Young diagrams was found in the context of 4D 2D duality. Recursion relations among the basis are summarized in the form of an algebra SH c which is universal for any N. We show that it has an S3 automorphism which is referred to as triality. We study the level- rank duality between minimal models, which is a special example of the automorphism. It is shown that the nonvanishing states in both systems are described by N or M Young diagrams with the rows of boxes appropriately shued. The reshuing of rows implies there exists partial ordering of the set which labels them. For the simplest example, one can compute the partition functions for the partially ordered set (poset) explicitly, which reproduces the Rogers-Ramanujan identities. We also study the description of minimal models by SH c . Simple analysis reproduces some known properties of minimal models, the structure of singular vectors and the N-Burge condition in the Hilbert space. Author(s): Johnson, William Andrew | Advisor(s): Scanlon, Thomas | Abstract: This dissertation is a collection of results in model theory, related in one way or another to fields, NIP theories, and elimination of imaginaries. The most important result is a classification of dp-minimal fields, presented in Chapter 9. We construct in a canonical fashion a non-trivial Hausdorff definable field topology on any unstable dp-minimal field. Usingthis we classify the dp-minimal pure fields and valued fields up to elementary equivalence. Furthermore we prove that every VC-minimal field is real closed or algebraically closed.In Chapter 11, we analyze the theories of existentially closed fields with several valuations and orderings, as studied by van den Dries. We show that these model complete theories are NTP2, and analyze forking, dividing, and burden in these theories. The theory of algebraically closed fields with n independent valuation rings turns out to be an example of such a theory. This provides a new and natural example of an NTP2 theory which is neithersimple nor NIP, nor even a conceptual hybrid of something simple and something NIP.In Chapter 8, we exhibit a bad failure of elimination of imaginaries in a dense o-minimal structure. We produce an exotic interpretable set which cannot be put in definable bijection with a definable set, after naming any amount of parameters. However, we show that these exotic interpretable sets are still amenable to some of the tools of tame topology: they mustadmit nice definable topologies locally homeomorphic to definable sets.Chapter 12 proves the existence of Z nZ-valued definable strong Euler characteristics on pseudofinite fields, which measure the non-standard “size” of definable sets, mod n. The non-trivial result is that these “sizes” are definable in families of definable sets. This could probably be proven e cohomology, but we give a more elementary proof relying heavily on the theory of abelian varieties.We also present simplified and new proofs of several model-theoretic facts, including the definability of irreducibility and Zariski closure in ACF (Chapter 10), and elimination of imaginaries in ACVF (Chapter 6). This latter fact was originally proven by Haskell, Hrushovski, and Macpherson. We give a proof that is drastically simpler, inspired by Poizat’s proofs of elimination of imaginaries in ACF and DCF. We show that the Graph Isomorphism (GI) problem and the more general problems of String Isomorphism (SI) andCoset Intersection (CI) can be solved in quasipolynomial(exp((logn)O(1))) time. The best previous bound for GI was exp(O( √n log n)), where n is the number of vertices (Luks, 1983); for the other two problems, the bound was similar, exp(O (√ n)), where n is the size of the permutation domain (Babai, 1983). Following the approach of Luks’s seminal 1980 82 paper, the problem we actually address is SI. This problem takes two strings of length n and a permutation group G of degree n (the “ambient group”) as input (G is given by a list of generators) and asks whether or not one of the strings can be transformed into the other by some element of G. Luks’s divide-and-conquer algorithm for SI proceeds by recursion on the ambient group. We build on Luks’s framework and attack the obstructions to efficient Luks recurrence via an interplay between local and global symmetry. We construct group theoretic “local certificates” to certify the presence or absence of local symmetry, aggregate the negative certificates to canonical k-ary relations where k = O(log n), and employ combinatorial canonical partitioning techniques to split the k-ary relational structure for efficient divide-and- conquer. We show that in a well–defined sense, Johnson graphs are the only obstructions to effective canonical partitioning. The central element of the algorithm is the “local certificates” routine which is based on a new group theoretic result, the “Unaffected stabilizers lemma,” that allows us to construct global automorphisms out of local information. We define new invariants of 3d Calabi-Yau categories endowed with a stability structure. Intuitively, they count the number of semistable objects with fixed class in the K-theory of the category ("number of BPS states with given charge" in physics language). Formally, our motivic DT-invariants are elements of quantum tori over a version of the Grothendieck ring of varieties over the ground field. Via the quasi-classical limit "as the motive of affine line approaches to 1" we obtain numerical DT-invariants which are closely related to those introduced by Behrend. We study some properties of both motivic and numerical DT-invariants including the wall-crossing formulas and integrality. We discuss the relationship with the mathematical works (in the non-triangulated case) of Joyce, Bridgeland and Toledano-Laredo, as well as with works of physicists on Seiberg-Witten model (string junctions), classification of N=2 supersymmetric theories (Cecotti-Vafa) and structure of the moduli space of vector multiplets. Relating the theory of 3d Calabi-Yau categories with distinguished set of generators (called cluster collection) with the theory of quivers with potential we found the connection with cluster transformations and cluster varieties (both classical and quantum). We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on streams) and of tree relabelling as in attribute evaluation. We propose a generic semantics for extensions of simply typed lambda calculus with context-dependent operations analogous to the Moggi-style semantics for effectful languages based on strong monads. This continues the work in the early 90s by Brookes, Geva and Van Stone on the use of computational comonads in intensional semantics. Using the Minimal Model Program, any degeneration of K-trivial varieties can be arranged to be in a Kulikov type form, i.e. with trivial relative canonical divisor and mild singularities. In the hyper-K "ahler setting, we can then deduce a finiteness statement for monodromy acting on @math , once one knows that one component of the central fiber is not uniruled. Independently of this, using deep results from the geometry of hyper-K "ahler manifolds, we prove that a finite monodromy projective degeneration of hyper-K "ahler manifolds has a smooth filling (after base change and birational modifications). As a consequence of these two results, we prove a generalization of Huybrechts' theorem about birational versus deformation equivalence, allowing singular central fibers. As an application, we give simple proofs for the deformation type of certain geometric constructions of hyper-K "ahler manifolds (e.g. Debarre--Voisin or Laza--Sacc a--Voisin). In a slightly different direction, we establish some basic properties (dimension and rational homology type) for the dual complex of a Kulikov type degeneration of hyper-K "ahler manifolds. We introduce a fermionic formula associated with any quantum affine algebra U q (X N (r) . Guided by the interplay between corner transfer matrix and the Bethe ansatz in solvable lattice models, we study several aspects related to representation theory, most crucially, the crystal basis theory. They include one-dimensional sums over both finite and semi-infinite paths, spinon character formulae, Lepowsky—Primc type conjectural formula for vacuum string functions, dilogarithm identities, Q-systems and their solution by characters of various classical subalgebras and so forth. The results expand [HKOTY1] including the twisted cases and more details on inhomogeneous paths consisting of non-perfect crystals. As a most intriguing example, certain inhomogeneous one-dimensional sums conjecturally give rise to branching functions of an integrable G 2 (1) -module related to the embedding G 2 (1) ↪ B 3 (1) ↪ D 4 1 . Let Det_n denote the closure of the GL_ n^2 (C)-orbit of the determinant polynomial det_n with respect to linear substitution. The highest weights (partitions) of irreducible GL_ n^2 (C)-representations occurring in the coordinate ring of Det_n form a finitely generated monoid S(Det_n). We prove that the saturation of S(Det_n) contains all partitions lambda with length at most n and size divisible by n. This implies that representation theoretic obstructions for the permanent versus determinant problem must be holes of the monoid S(Det_n). A k-ary weak near-unanimity operation (or k-WNU) on A is an operation that satisfies the equations w(x, . . . x) ≈ x and w(y, x, . . . , x) ≈ w(x, y, . . . , x) ≈ · · · ≈ w(x, x, . . . , x, y) . If an algebra A has a k-NU (or a k-WNU) term operation, we say that A satisfies NU(k) (or WNU(k), respectively). Likewise, a variety is said to satisfy NU(k) (or WNU(k), respectively), it it has a k-variable term satisfying these equations. It has been conjectured that a finite idempotent algebra A has finite relational width if and only if V(A) (the variety generated by A) has meet semi-distributive congruence lattices. The concept of “finite relational width” arises in the theory of complexity of algorithms, in the algebraic study of constraint-satisfaction problems. Actually, there are several different definitions of this concept and it is not known if they are equivalent. One version of the concept and the conjecture mentioned above are due to B. Larose and L. Zadori [10]. The important family of varieties with meet semi-distributive congruence lattices has various known characterizations. There is a characterization by a certain Maltsev condition; also, it is known that a locally finite variety has this property iff it omits congruence covers of types 1 and 2 (defined in the tame congruence theory of D. Hobby, R. McKenzie [6]). E. Kiss showed that a finite idempotent algebra of relational width k must have an m-WNU term operation for every m ≥ k. E. Kiss and M. Valeriote then observed that a finite algebra with a k-WNU term operation, k > 1, must omit congruence covers of type 1. These observations led M. Valeriote to make two conjectures: any locally finite variety omits congruence covers of type 1 iff it satisfies WNU(k) for some k > 1; any locally finite variety has meet semi-distributive congruence lattices if and only if for some k, it satisfies WNU(m) for all m ≥ k. In this paper, we prove both of these conjectures of M. Valeriote. The family of locally finite varieties omitting type 1 is the largest family of locally finite varieties defined by a nontrivial idempotent Maltsev condition. For this