English
Related papers

Related papers: Compound Optics

200 papers

Dynamical systems---by which we mean machines that take time-varying input, change their state, and produce output---can be wired together to form more complex systems. Previous work has shown how to allow collections of machines to…

Category Theory · Mathematics 2020-06-12 David I. Spivak

In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…

Combinatorics · Mathematics 2013-05-14 Alexander Grigor'yan , Yong Lin , Yuri Muranov , Shing-Tung Yau

Batanin and Markl's operadic categories are categories in which each map is endowed with a finite collection of "abstract fibres" -- also objects of the same category -- subject to suitable axioms. We give a reconstruction of the data and…

Category Theory · Mathematics 2021-03-31 Richard Garner , Joachim Kock , Mark Weber

The polarization process when polarizers act on an optical field is studied. We give examples for two kinds of polarizers. The first kind presents an anisotropic absorption - as in a polaroid film - and the second one is based on total…

Optics · Physics 2008-09-09 J. Lages , R. Giust , J. -M. Vigoureux

We introduce a notion of join for (augmented) simplicial sets generalising the classical join of geometric simplicial complexes. The definition comes naturally from the ordinal sum on the base simplicial category $\Delta$.

Category Theory · Mathematics 2007-05-23 P. J. Ehlers , T. Porter

We introduce some compact orbifolds on which there is a certain finite group action having a simple convex polytope as the orbit space. We compute the orbifold fundamental group and homology groups of these orbifolds. We calculate the…

Algebraic Topology · Mathematics 2011-05-10 Soumen Sarkar

The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…

Combinatorics · Mathematics 2013-09-25 Gareth A. Jones

We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…

Combinatorics · Mathematics 2010-08-30 P. Blasiak

We describe classes of toric varieties of codimension 2 which are either minimally defined by 3 binomial equations over any algebraically closed field, or are set-theoretic complete intersections in exactly one positive characteristic.

Commutative Algebra · Mathematics 2007-06-28 Margherita Barile

A premonoidal category is equipped only with a bifunctor and a natural isomorphism for associativity. We introduce a (deformation) natural automorphism representing the deviation from the Pentagon condition. We uncover a binary tree…

Category Theory · Mathematics 2007-05-23 W. P. Joyce

A double category is constructed from a `fattened' version of a given category, motivated in part by a context of parallel transport. We also study monoidal structures on the underlying category and on the fattened category.

Mathematical Physics · Physics 2012-05-17 Saikat Chatterjee , Amitabha Lahiri , Ambar N. Sengupta

This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…

Algebraic Topology · Mathematics 2011-02-22 Inna Zakharevich

For two general polytopal complexes the set of face-wise affine maps between them is shown to be a polytopal complex in an algorithmic way. The resulting algorithm for the affine hom-complex is analyzed in detail. There is also a natural…

Combinatorics · Mathematics 2016-03-31 M. Bakuradze , A. Gamkrelidze , J. Gubeladze

Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

We define the phrase `category enriched in an fc-multicategory' and explore some examples. An fc-multicategory is a very general kind of 2-dimensional structure, special cases of which are double categories, bicategories, monoidal…

Category Theory · Mathematics 2007-05-23 Tom Leinster

In this note, we study the general form of a multiplicative bijection on several families of functions defined on manifolds, both real or complex valued. In the real case, we prove that it is essentially defined by a composition with a…

Classical Analysis and ODEs · Mathematics 2011-11-22 Shiri Artstein-Avidan , Dmitry Faifman , Vitali Milman

Operads were originally defined as V-operads, that is, enriched in a symmetric or braided monoidal category V. The symmetry or braiding in V is required in order to describe the associativity axiom the operads must obey, as well as the…

Category Theory · Mathematics 2007-05-23 S. Forcey , J. Siehler , E. Seth Sowers

The centre of a monoidal category is a braided monoidal category. Monoidal categories are monoidal objects (or pseudomonoids) in the monoidal bicategory of categories. This paper provides a universal construction in a braided monoidal…

Category Theory · Mathematics 2007-05-23 Ross Street

Some basic features of the simultaneous inclusion of discrete fibrations and discrete opfibrations on a category A in the category of categories over A are studied; in particular, the reflections and the coreflections of the latter in the…

Category Theory · Mathematics 2007-05-23 Claudio Pisani

The concept of_refinement_ in type theory is a way of reconciling the "intrinsic" and the "extrinsic" meanings of types. We begin with a rigorous analysis of this concept, settling on the simple conclusion that the type-theoretic notion of…

Logic in Computer Science · Computer Science 2013-10-02 Paul-André Melliès , Noam Zeilberger
‹ Prev 1 8 9 10 Next ›