scholarly journals On Graph-Theoretical Invariants of Combinatorial Manifolds

10.37236/7493 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
Alberto Cavicchioli ◽  
Fulvia Spaggiari

The goal of this paper is to give some theorems which relate to the problem of classifying combinatorial (resp. smooth)  closed manifolds up to piecewise-linear (PL) homeomorphism. For this, we use the combinatorial approach to the topology of PL manifolds by means of a special kind of edge-colored graphs, called crystallizations. Within this representation theory, Bracho and Montejano introduced in 1987 a nonnegative numerical invariant, called the reduced complexity, for any closed $n$-dimensional PL manifold.  Here we consider this invariant, and extend in this context the concept of average order first introduced by Luo and Stong in 1993, and successively investigated by Tamura in 1996 and 1998. Then  we obtain some  classification  results for  closed connected smooth low-dimensional manifolds according to  reduced complexity and average order. Finally, we answer to a question posed by Trout in 2013.

2016 ◽  
Vol 25 (01) ◽  
pp. 1650005 ◽  
Author(s):  
M. R. Casali ◽  
P. Cristofori ◽  
C. Gagliardi

Simple crystallizations are edge-colored graphs representing piecewise linear (PL) 4-manifolds with the property that the 1-skeleton of the associated triangulation equals the 1-skeleton of a 4-simplex. In this paper, we prove that any (simply-connected) PL 4-manifold [Formula: see text] admitting a simple crystallization admits a special handlebody decomposition, too; equivalently, [Formula: see text] may be represented by a framed link yielding [Formula: see text], with exactly [Formula: see text] components ([Formula: see text] being the second Betti number of [Formula: see text]). As a consequence, the regular genus of [Formula: see text] is proved to be the double of [Formula: see text]. Moreover, the characterization of any such PL 4-manifold by [Formula: see text], where [Formula: see text] is the gem-complexity of [Formula: see text] (i.e. the non-negative number [Formula: see text], [Formula: see text] being the minimum order of a crystallization of [Formula: see text]), implies that both PL invariants gem-complexity and regular genus turn out to be additive within the class of all PL 4-manifolds admitting simple crystallizations (in particular, within the class of all “standard” simply-connected PL 4-manifolds).


2018 ◽  
Author(s):  
João Marcelo Lamim Ribeiro ◽  
Pratyush Tiwary

AbstractIn this work we demonstrate how to leverage our recent iterative deep learning–all atom molecular dynamics (MD) technique “Reweighted autoencoded variational Bayes for enhanced sampling (RAVE)” (Ribeiro, Bravo, Wang, Tiwary, J. Chem. Phys. 149, 072301 (2018)) for sampling protein-ligand unbinding mechanisms and calculating absolute binding affinities when plagued with difficult to sample rare events. RAVE iterates between rounds of MD and deep learning, and unlike other enhanced sampling methods, it stands out in simultaneously learning both a low-dimensional physically interpretable reaction coordinate (RC) and associated free energy. Here, we introduce a simple but powerful extension to RAVE which allows learning a position-dependent RC expressed as a superposition of piecewise linear RCs valid in different metastable states. With this approach, we retain the original physical interpretability of a RAVE-derived RC while making it applicable to a wider range of complex systems. We demonstrate how in its multi-dimensional form introduced here, RAVE can efficiently simulate the unbinding of the tightly bound benzene-lysozyme (L99A variant) complex, in all atom-precision and with minimal use of human intuition except for the choice of a larger dictionary of order parameters. These simulations had a 100 % success rate, and took between 3–50 nanoseconds for a process that takes on an average close to few hundred milliseconds, thereby reflecting a seven order of magnitude acceleration relative to straightforward MD. Furthermore, without any time-dependent biasing, the trajectories display clear back–and– forth movement between various metastable intermediates, demonstrating the reliability of the RC and its probability distribution learnt in RAVE. Our binding free energy is in good agreement with other reported simulation results. We thus believe that RAVE, especially in its multi-dimensional variant introduced here, will be a useful tool for simulating the dissociation process of practical biophysical systems with rare events in an automated manner with minimal use of human intuition.


2002 ◽  
Vol 11 (1) ◽  
pp. 236-258 ◽  
Author(s):  
Marcelo C Medeiros ◽  
Alvaro Veiga ◽  
Mauricio G. C Resende

2020 ◽  
Vol 15 ◽  
pp. 49
Author(s):  
Harbir Lamba ◽  
Pavel Krejčí ◽  
Dmitrii Rachinskii

We consider piecewise-linear, discrete-time, macroeconomic models that have a continuum of feasible equilibrium states. The non-trivial equilibrium set and resulting path-dependence are induced by stickiness in either expectations or the response of the Central Bank. For a low-dimensional variant of the model with one representative agent, and also for a multi-agent model, we show that when exogenous noise is absent from the system the continuum of equilibrium states is the global attractor and each solution trajectory converges exponentially to one of the equilibria. Further, when a uniformly bounded noise is present, or the equilibrium states are destabilized by an imperfect Central Bank policy (or both), we estimate the size of the domain that attracts all the trajectories. The proofs are based on introducing a family of Lyapunov functions and, for the multi-agent model, deriving a formula for the inverse of the Prandtl-Ishlinskii operator acting in the space of discrete-time inputs and outputs.


2019 ◽  
Author(s):  
Nico Curti ◽  
Enrico Giampieri ◽  
Giuseppe Levi ◽  
Gastone Castellani ◽  
Daniel Remondini

The objective of many high-throughput “omics” studies is to obtain a relatively low-dimensional set of observables - signature - for sample classification purposes (diagnosis, prognosis, stratification). We propose DNetPRO, Discriminant Analysis with Network PROcessing, a supervised signature identification method based on a bottom-up combinatorial approach that exploits the discriminant power of all variable pairs. The algorithm is easily scalable allowing efficient computing even for high number of observables (104 − 105). We show applications on real high-throughput genomic datasets in which our method outperforms existing results, or compares to them but with a smaller number of selected variables. Moreover the linearity of DNetPRO allows a clearer interpretation of the obtained signatures in comparison to non linear classification models


2014 ◽  
Vol 24 (05) ◽  
pp. 1450067 ◽  
Author(s):  
R. Suresh ◽  
K. Srinivasan ◽  
D. V. Senthilkumar ◽  
K. Murali ◽  
M. Lakshmanan ◽  
...  

We experimentally demonstrate the effect of dynamic environment coupling in a system of coupled piecewise linear time-delay electronic circuits with mutual and subsystem coupling configurations. Time-delay systems are essentially infinite-dimensional systems with complex phase-space properties. Dynamic environmental coupling with mutual coupling configuration has been recently theoretically shown to induce complete (CS) and inverse synchronizations (IS) [Resmi et al., 2010] in low-dimensional dynamical systems described by ordinary differential equations (ODEs), for which no experimental confirmation exists. In this paper, we investigate the effect of dynamic environment for the first time in mutual as well as subsystem coupling configurations in coupled time-delay differential equations theoretically and experimentally. Depending upon the coupling strength and the nature of feedback, we observe a transition from asynchronization to CS via phase synchronization and from asynchronization to IS via inverse-phase synchronization in both coupling configurations. The results are corroborated by snapshots of the time evolution, phase projection plots and localized sets as observed from the oscilloscope. Further, the synchronization is also confirmed numerically from the largest Lyapunov exponents, correlation of probability of recurrence and correlation coefficient of the coupled time-delay system. We also present a linear stability analysis and obtain conditions for different synchronized states.


2009 ◽  
Vol 07 (supp01) ◽  
pp. 195-203 ◽  
Author(s):  
ZOLTÁN KÁDÁR ◽  
ANNALISA MARZUOLI ◽  
MARIO RASETTI

The spin network quantum simulator relies on the su(2) representation ring (or its q-deformed counterpart at q = root of unity) and its basic features naturally include (multipartite) entanglement and braiding. In particular, q-deformed spin network automata are able to perform efficiently approximate calculations of topological invarians of knots and 3-manifolds. The same algebraic background is shared by 2D lattice models supporting topological phases of matter that have recently gained much interest in condensed matter physics. These developments are motivated by the possibility to store quantum information fault-tolerantly in a physical system supporting fractional statistics since a part of the associated Hilbert space is insensitive to local perturbations. Most of currently addressed approaches are framed within a "double" quantum Chern–Simons field theory, whose quantum amplitudes represent evolution histories of local lattice degrees of freedom.We propose here a novel combinatorial approach based on "state sum" models of the Turaev–Viro type associated with SU(2)q-colored triangulations of the ambient 3-manifolds. We argue that boundary 2D lattice models (as well as observables in the form of colored graphs satisfying braiding relations) could be consistently addressed. This is supported by the proof that the Hamiltonian of the Levin–Wen condensed string net model in a surface Σ coincides with the corresponding Turaev–Viro amplitude on Σ × [0,1] presented in the last section.


Sign in / Sign up

Export Citation Format

Share Document