English
Related papers

Related papers: Functions out of Higher Truncations

200 papers

A certain class of matrix-valued Borel matrix functions is introduced and it is shown that all functions of that class naturally operate on any operator T in a finite type I von Neumann algebra M in a way such that uniformly bounded…

Operator Algebras · Mathematics 2017-05-26 Piotr Niemiec

The study of homotopy theoretic phenomena in the language of type theory is sometimes loosely called `synthetic homotopy theory'. Homotopy theory in type theory is only one of the many aspects of homotopy type theory, which also includes…

Logic · Mathematics 2019-06-25 Egbert Rijke

Directed Algebraic Topology is beginning to emerge from various applications. The basic structure we shall use for such a theory, a 'd-space', is a topological space equipped with a family of 'directed paths', closed under some operations.…

Algebraic Topology · Mathematics 2007-05-23 Marco Grandis

Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…

Combinatorics · Mathematics 2021-11-10 Stephen Wolfram

Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…

Operator Algebras · Mathematics 2018-12-31 Greg Friedman , Efton Park

We consider the extension of techniques for bounding higher-dimension operators in quantum effective field theories to higher-point operators. Working in the context of theories polynomial in $X=(\partial \phi)^2$, we examine how the…

High Energy Physics - Theory · Physics 2018-12-11 Venkatesa Chandrasekaran , Grant N. Remmen , Arvin Shahbazi-Moghaddam

To every homotopy n-nilpotent group, defined in earlier work by Dwyer and the author, we associate an endofunctor of pointed spaces and prove that it is looped and n-excisive. As a tool we prove that $\Omega P_n({\rm id})$ commutes with…

Algebraic Topology · Mathematics 2017-05-16 Georg Biedermann

Higher-order representations of objects such as programs, proofs, formulas and types have become important to many symbolic computation tasks. Systems that support such representations usually depend on the implementation of an intensional…

Programming Languages · Computer Science 2007-05-23 Xiaochu Qi

Simplicial type theory extends homotopy type theory with a directed path type which internalizes the notion of a homomorphism within a type. This concept has significant applications both within mathematics -- where it allows for synthetic…

Logic in Computer Science · Computer Science 2026-01-16 Daniel Gratzer , Jonathan Weinberger , Ulrik Buchholtz

We state and analyze a generalization of the "truncation trick" suggested by Gourdon and Sebah to improve the performance of power series evaluation by binary splitting. It follows from our analysis that the values of D-finite functions…

Symbolic Computation · Computer Science 2012-09-25 Marc Mezzarobba

We explicitely unveil several classes of inner functions $u$ in $H^\infty$ with the property that there is $\eta\in ]0,1[$ such that the level set $\Omega_u(\eta):=\{z\in\mathbb D: |u(z)|<\eta\}$ is connected. These so-called one-component…

Complex Variables · Mathematics 2017-03-17 Joseph Cima , Raymond Mortini

The low-energy effective action of type-I superstring theory in ten dimensions is obtained performing a truncation of type-IIB supergravity in a background where D9-branes are present. The open sector corresponds to the first order in the…

High Energy Physics - Theory · Physics 2010-04-05 Fabio Riccioni

Polynomial functors are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this broader perspective the polynomial aspect…

Logic in Computer Science · Computer Science 2014-07-15 Joachim Kock

The $E_2$ term of the Adams spectral sequence may be identified with certain derived functors, and this also holds for a number of other spectral sequences. Our goal is to show how the higher terms of such spectral sequences are determined…

Algebraic Topology · Mathematics 2024-12-31 Hans-Joachim Baues , David Blanc , Boris Chorny

Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…

Logic in Computer Science · Computer Science 2023-06-22 Emmanuel Hainry , Romain Péchoux

We study continuous, symmetric and unanimous aggregation functions and continuous majority functions and prove that such functions exist on a choice space if and only if the choice space is contractible.

Algebraic Topology · Mathematics 2018-07-23 Shreyas Samaga

Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper,…

Programming Languages · Computer Science 2013-09-23 J. Launchbury , S. Krstic , T. E. Sauerwein

One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product of 2-categories. In this paper we continue the developments of [3] and [2] by understanding the…

Category Theory · Mathematics 2009-09-28 Mark Weber

Truncated Toeplitz operators are C--symmetric with respect to the canonical conjugation given on an appropriate model space. However, by considering only one conjugation one cannot characterize truncated Toeplitz operators. It will be…

Functional Analysis · Mathematics 2016-12-15 Kamila Kliś-Garlicka , Bartosz Łanucha , Marek Ptak

We consider prescriptive type systems for logic programs (as in Goedel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program is "well-typed", then all derivations starting in a…

Logic in Computer Science · Computer Science 2007-05-23 Pierre Deransart , Jan-Georg Smaus