English
Related papers

Related papers: Concurrent Process up to Homotopy (I)

200 papers

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

Combinatorics · Mathematics 2007-05-23 E. Babson , H. Barcelo , M. de Longueville , R. Laubenbacher

We give a general framework for studying G-CW complexes via the orbit category. As an application we show that the symmetric group G=S_5 admits a finite G-CW complex X homotopy equivalent to a sphere, with cyclic isotropy subgroups.

Algebraic Topology · Mathematics 2010-02-09 Ian Hambleton , Semra Pamuk , Ergun Yalcin

Proposed models of closed timelike curves (CTCs) have been shown to enable powerful information-processing protocols. We examine the simulation of models of CTCs both by other models of CTCs and by physical systems without access to CTCs.…

Quantum Physics · Physics 2017-02-28 Todd A. Brun , Mark M. Wilde

We interpret mathematically the pair (master equation, solution of master equation) up to equivalence, as the pair (a presentation of a free triangular dga T over a combination operad O, dga map of T into C, a dga over O) up to homotopy…

Quantum Algebra · Mathematics 2008-03-06 Dennis Sullivan

This short note introduces a notion of directed homotopy equivalence and of "directed" topological complexity (which elaborates on the notion that can be found in e.g. Farber's book) which have a number of desirable joint properties. In…

Algebraic Topology · Mathematics 2017-10-10 Eric Goubault

In this paper, we propose an efficient continuation method for locating multiple power flow solutions. We adopt the holomorphic embedding technique to represent solution curves as holomorphic functions in the complex plane. The…

Systems and Control · Computer Science 2019-05-07 Dan Wu , Bin Wang

An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…

Quantum Physics · Physics 2007-05-23 T. Rudolph

A heterodimensional cycle is an invariant set of a dynamical system consisting of two hyperbolic periodic orbits with different dimensions of their unstable manifolds and a pair of orbits that connect them. For systems which are at least…

Dynamical Systems · Mathematics 2024-04-11 Dongchen Li , Dmitry Turaev

In this note, we discuss the mean curvature flow of graphs of maps between Riemannian manifolds. Special emphasis will be placed on estimates of the flow as a non-linear parabolic system of differential equations. Several global existence…

Differential Geometry · Mathematics 2012-04-05 Mu-Tao Wang

We present a framework for modeling complex, high-dimensional distributions on convex polytopes by leveraging recent advances in discrete and continuous normalizing flows on Riemannian manifolds. We show that any full-dimensional polytope…

Machine Learning · Computer Science 2025-03-18 Tomek Diederen , Nicola Zamboni

Mathematical and computational modelling of biochemical networks is often done in terms of either the concentrations of molecular species or the fluxes of biochemical reactions. When is mathematical modelling from either perspective…

Molecular Networks · Quantitative Biology 2015-12-10 Ronan M. T. Fleming , Nikos Vlassis , Ines Thiele , Michael A. Saunders

This paper defines homology in homotopy type theory, in the process stable homotopy groups are also defined. Previous research in synthetic homotopy theory is relied on, in particular the definition of cohomology. This work lays the…

Logic · Mathematics 2018-12-27 Robert Graham

Establishing the existence of periodic orbits is one of the crucial and most intricate topics in the study of dynamical systems, and over the years, many methods have been developed to this end. On the other hand, finding closed orbits in…

Dynamical Systems · Mathematics 2022-01-25 Marian Mrozek , Roman Srzednicki , Justin Thorpe , Thomas Wanner

Heteroclinic connections are trajectories that link invariant sets for an autonomous dynamical flow: these connections can robustly form networks between equilibria, for systems with flow-invariant spaces. In this paper we examine the…

Dynamical Systems · Mathematics 2019-09-04 Peter Ashwin , Sofia Castro , Alexander Lohse

This paper is concerned with the study of a model case of first order Hamilton-Jacobi equations posed on a "junction", that is to say the union of a finite number of half-lines with a unique common point. The main result is a comparison…

Analysis of PDEs · Mathematics 2013-03-11 Cyril Imbert , Régis Monneau , Hasnaa Zidani

We study Morse theory on noncompact manifolds equipped with exhaustions by compact pieces, defining the Morse homology of a pair which consists of the manifold and related geometric/homotopy data. We construct a collection of Morse data…

Geometric Topology · Mathematics 2019-11-12 Taesu Kim

We develop a Hamiltonian description of point particles in (2+1)-dimensions using connection and frame-field variables for general relativity. The topology of each spatial hypersurface is that of a punctured two-sphere with particles…

General Relativity and Quantum Cosmology · Physics 2015-06-23 Jonathan Ziprick

We define the concept of continuum wise expansive for flows, and we prove that continuum wise expansive flows on compact metric spaces with topological dimension greater than one have positive entropy.

Dynamical Systems · Mathematics 2015-10-29 Alexander Arbieto , Welington Cordeiro , Maria Jose Pacifico

Process calculi based on logic, such as $\pi$DILL and CP, provide a foundation for deadlock-free concurrent programming. However, in previous work, there is a mismatch between the rules for constructing proofs and the term constructors of…

Logic in Computer Science · Computer Science 2019-04-16 Wen Kokke , Fabrizio Montesi , Marco Peressotti

Every Model of High-Level Computation (MHC) has an underlying composition mechanism for combining simple computing devices into more complex ones. Composition can be done by (explicitly or implicitly) defining control flow, data flow or any…

Logic in Computer Science · Computer Science 2026-05-22 Damian Arellanes
‹ Prev 1 8 9 10 Next ›