Results 91 to 100 of about 31,249 (277)

Modular functors, cohomological field theories and topological recursion [PDF]

open access: yes, 2018
Given a topological modular functor V in the sense of Walker, we construct vector bundles [Z (lambda) over bar](g,n), over (M) over bar (g,n) whose Chern characters define semi-simple cohomological field theories.
Orantin, Nicolas   +8 more
core   +1 more source

Recursive automorphisms of recursive linear orderings

open access: yesAnnals of Pure and Applied Logic, 1984
By a priority argument, the author shows that a necessary and sufficient condition for a recursive linear ordering R to admit a non-trivial automorphism is that R contains a dense interval.
openaire   +1 more source

Differential recursion [PDF]

open access: yesACM Transactions on Computational Logic, 2009
We present a redevelopment of the theory of real-valued recursive functions that was introduced by C. Moore in 1996 by analogy with the standard formulation of the integer-valued recursive functions. While his work opened a new line of research on analog computation, the original paper contained some technical inaccuracies.
openaire   +1 more source

How Tariffs Shape Trade‐Embodied Emissions in the European Union: Sectoral Heterogeneity in Final Demand

open access: yesSustainable Development, EarlyView.
ABSTRACT This paper examines the environmental implications of tariffs on greenhouse gas emissions embodied in extra‐European Union imports consumed by domestic final demand in the EU. Using a multidimensional country‐sector‐year framework, the study investigates whether tariff changes are associated with variations in trade‐embodied emissions and ...
Hugo Campos‐Romero
wiley   +1 more source

Geometric recursion [PDF]

open access: yes, 2023
We propose a general theory for constructing functorial assignments $\Sigma \longmapsto \Omega_{\Sigma} \in E(\Sigma)$ for a large class of functors $E$ from a certain category of bordered surfaces to a suitable target category of topological vector ...
Andersen, Jørgen Ellegaard   +2 more
core  

Recursive linear orders with recursive successivities

open access: yesAnnals of Pure and Applied Logic, 1984
A successivity in a linear ordering \(
openaire   +2 more sources

Can AI be Easy? Lessons Learned From the EZR.py Toolkit

open access: yesSoftware: Practice and Experience, EarlyView.
ABSTRACT Much recent press claims that developers no longer need to read code. We disagree, at least within the domain of tabular software‐engineering (SE) optimization tasks: rows of x$$ x $$ and y$$ y $$ values where the y$$ y $$ values are expensive to obtain.
Tim Menzies   +2 more
wiley   +1 more source

Multicanonical recursions [PDF]

open access: yesJournal of Statistical Physics, 1996
23 pages, latex, 4 postscript figures included (uuencoded Z-compressed .tar file created by uufiles), figure file corrected.
openaire   +2 more sources

Modelling Suicide‐Related Communication Dynamics: A Socio‐Cybernetic Framework for Governance

open access: yesSystems Research and Behavioral Science, EarlyView.
ABSTRACT Suicide‐related phenomena (SPS) are often approached through individual‐level risk factors or moral framings, yet their population‐level dynamics depend critically on how ‘suicide’ becomes observable, circulates and is governed across functionally differentiated systems.
Enrique Fernández Vilas, Juan R. Coca
wiley   +1 more source

Illuhmannating Technological Innovation Systems: Towards a Systems Perspective

open access: yesSystems Research and Behavioral Science, EarlyView.
ABSTRACT The Technological Innovation Systems framework operates from an economic perspective, investigating the generation, diffusion and utilization of a specific technology within a particular institutional infrastructure. Emerging from innovation sciences, the TIS framework inherited methodological individualism as the micro‐level approach to ...
Richard Pretorius   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy