fault tolerant hamiltonian laceability of balanced hypercubes the balanced hypercube as a new variant of hypercube has many desirable properties such as strong connectivity high regularity and symmetry the particular property of the balanced hypercube is that each processor has a backup processor sharing the same neighborhood a hamiltonian bipartite graph g v 0 v 1 e is said to be hamiltonian laceable if there is a hamiltonian path between any two vertices x v 0 and y v 1 it has been proved that the balanced hypercube bh n is hamiltonian laceable for all n 1 in this paper we have proved that after at most 2 n 2 faulty edges occur bh n remains hamiltonian laceable for all n 2 this result is optimal with respect to the number of faulty edges can be tolerated in bh n

two disjoint cycle cover bipancyclicity of balanced hypercubes abstract a bipartite graph g is two disjoint cycle cover r1 r2 bipancyclic if for any even integer l satisfying r1 l r2 there exist two vertex disjoint cycles c1 and c2 in g such that v c 1 l and v c 2 v g l where v g denotes the number of vertices in g in this paper we study the two disjoint cycle cover bipancyclicity of the n dimensional balanced hypercube bhn which is a hypercube variant network and is superior to hypercube due to having a smaller diameter as a consequence we show that bhn is two disjoint cycle cover 4 2 2 n 1 bipancyclic for n 2

flots et series de taylor stochastiques we study the expansion of the solution of a stochastic differential equation as an infinite sum of iterated stochastic stratonovitch integrals this enables us to give a universal and explicit formula for any invariant diffusion on a lie group in terms of lie brackets as well as a universal and explicit formula for the brownian motion on a riemannian manifold in terms of derivatives of the curvature tensor the first of these formulae contains and extends to the non nilpotent case the results of doss 6 sussmann 17 yamato 18 fliess and normand cyrot 7 krener and lobry 19 and kunita 11 on the representation of solutions of stochastic differential equations

two node disjoint paths in balanced hypercubes the balanced hypercube bhn proposed by wu and huang is a variation of the hypercube it has been proved that the balanced hypercube is a node transitive and bipartite graph assume that the nodes are divided into two bipartite node sets x and y u and x are two different nodes in x and v and y are two different nodes in y in this paper we prove that there exist two node disjoint paths p x y and r u v in bhn and v p x y v r u v v bhn where n 1 the hamiltonian laceability of bhn which was proved by xu et al is also obtained from the corollary of our result

many hard examples for resolution for every choice of positive integers c and k such that k 3 and c 2 k 0 7 there is a positive number e such that with probability tending to 1 as n tends to a randomly chosen family of cn clauses of size k over n variables is unsatisfiable but every resolution proof of its unsatisfiability must generate at least 1 e n clauses

edge pancyclicity and hamiltonian laceability of the balanced hypercubes abstract the balanced hypercube bh n is a variant of the hypercube q n huang and wu proved that bh n has better properties than q n with the same number of links and processors in particularly they showed that there exists a cycle of length 2 l in bh n for all l 2 l 2 n in this paper we improve this result by showing that bh n is edge pancyclic which means that for arbitrary edge e there exists a cycle of even length from 4 to 2 2 n containing e in bh n we also show that the balanced hypercubes are hamiltonian laceable

super connectivity of balanced hypercubes abstract the reliability of an interconnection network is an important issue for multiprocessor systems in this paper we study a reliability measure called super connectivity in the balanced hypercube bh n which is a variant of the hypercube we show that the super connectivity of bh n is 4 n 4 and the super edge connectivity of bh n is 4 n 2 for n 2 that is to become a disconnected graph containing no isolated vertex we need to remove at least 4 n 4 vertices resp 4 n 2 edges from bh n

bipanconnectivity of balanced hypercubes the balanced hypercube proposed by wu and huang is a variant of the hypercube network in this paper paths of various lengths are embedded into balanced hypercubes a bipartite graph g is bipanconnected if for two arbitrary nodes x and y of g with distance d x y there exists a path of length l between x and y for every integer l with d x y l v g 1 and l d x y 0 mod 2 we prove that the n dimensional balanced hypercube bh n is bipanconnected for all n 1 this result is stronger than that obtained by xu et al which shows that the balanced hypercube is edge bipancyclic and hamiltonian laceable

the balanced hypercube a cube based system for fault tolerant applications in this paper we present an interconnection structure called the balanced hypercube which is a variation of the standard hypercube with desirable properties of strong connectivity regularity and symmetry the proposed structure is a special type of load balanced graph designed to tolerate processor failure in balanced hypercubes each processor has a backup matching processor that shares the same set of neighboring nodes therefore tasks that run on a faulty processor can be reactivated in the backup processor to provide efficient system reconfiguration other properties of balanced hypercubes are examined it is also shown that odd dimensional balanced hypercubes have smaller diameters than that of standard hypercubes as an application of balanced hypercubes we show a fault tolerant embedding of rings in balanced hypercubes

a construction of the rough path above fractional brownian motion using volterra s representation this note is devoted to construct a rough path above a multidimensional fractional brownian motion b with any hurst parameter h lesser than 1 2 by means of its representation as a volterra gaussian process this approach yields some algebraic and computational simplifications with respect to a recent preprint by unterberger where the construction of a rough path over b was first introduced

hamiltonian cycle embedding for fault tolerance in balanced hypercubes abstract the balanced hypercube bh n defined by wu and huang is a variant of the hypercube network yang proposed that fault tolerance of balanced hypercube bh n is an important issue in parallel computing which needs further study yang 2010 24 in this paper we prove that there exists a fault free hamiltonian path between any two adjacent vertices in bh n with 2 n 2 faulty edges as a corollary we derive that for any fault free edge e there exists a fault free hamiltonian cycle containing e in bh n with 2 n 2 faulty edges which is optimal in the sense of the number of faulty edges

holder continuous rough paths by fourier normal ordering we construct in this article an explicit geometric rough path over arbitrary d dimensional paths with finite 1 variation for any alpha in 0 1 the method may be coined as fourier normal ordering since it consists in a regularization obtained after permuting the order of integration in iterated integrals so that innermost integrals have highest fourier frequencies in doing so there appear non trivial tree combinatorics which are best understood by using the structure of the hopf algebra of decorated rooted trees in connection with the chen or multiplicative property and of the hopf shuffle algebra in connection with the shuffle or geometric property holder continuity is proved by using besov norms the method is well suited in particular in view of applications to probability theory see the companion article 34 for the construction of a rough path over multidimensional fractional brownian motion with hurst index 1 4 or 35 for a short survey in that case

symmetric property and reliability of balanced hypercube huang and wu in ieee transactions on computers 46 1997 484 490 introduced the balanced hypercube bh n as an interconnection network topology for computing systems and they proved that bh n is vertex transitive however some other symmetric properties say edge transitivity and arc transitivity of bh n remained unknown in this paper we solve this problem and prove that bh n is an arc transitive cayley graph using this we also investigate some reliability measures including super connectivity cyclic connectivity etc in bh n first we prove that every minimum edge cut of bh n n ge 2 isolates a vertex and every minimum vertex cut of bh n n ge 3 isolates a vertex this is stronger than that obtained by wu and huang which shows the connectivity and edge connectivity of bh n are 2n second yang applied mathematics and computation 219 2012 970 975 proved that for n ge 2 the super connectivity of bh n is 4n 4 and the super edge connectivity of bh n is 4n 2 in this paper we proved that bh n n ge 2 is super lambda prime but not super kappa prime that is every minimum super edge cut of bh n n ge 2 isolates an edge but the minimum super vertex cut of bh n n ge 2 does not isolate an edge third we also obtain that for n ge 2 the cyclic connectivity of bh n is 4n 4 and the cyclic edge connectivity of bh n is 4 2n 2 that is to become a disconnected graph which has at least two components containing cycles we need to remove at least 4n 4 vertices resp 4 4n 2 edges from bh n n ge 2

rough evolution equations we generalize lyons rough paths theory in order to give a pathwise meaning to some nonlinear infinite dimensional evolution equation associated to an analytic semigroup and driven by an irregular noise as an illustration we discuss a class of linear and nonlinear 1d spdes driven by a space time gaussian noise with singular space covariance and brownian time dependence

controlling rough paths abstract we formulate indefinite integration with respect to an irregular function as an algebraic problem which has a unique solution under some analytic constraints this allows us to define a good notion of integral with respect to irregular paths with holder exponent greater than 1 3 e g samples of brownian motion and study the problem of the existence uniqueness and continuity of solution of differential equations driven by such paths we recover young s theory of integration and the main results of lyons theory of rough paths in holder topology

stochastic analysis rough path analysis and fractional brownian motions in this paper we show by using dyadic approximations the existence of a geometric rough path associated with a fractional brownian motion with hurst parameter greater than 1 4 using the integral representation of fractional brownian motions we furthermore obtain a skohorod integral representation of the geometric rough path we constructed by the results in ly1 a stochastic integration theory may be established for fractional brownian motions and strong solutions and a wong zakai type limit theorem for stochastic differential equations driven by fractional brownian motions can be deduced accordingly the method can actually be applied to a larger class of gaussian processes with covariance functions satisfying a simple decay condition

stochastic calculus with respect to gaussian processes in this paper we develop a stochastic calculus with respect to a gaussian process of the form b t int t 0 k t s dw s where w is a wiener process and k t s is a square integrable kernel using the techniques of the stochastic calculus of variations we deduce change of variable formulas for the indefinite integrals and we study the approximation by riemann sums the particular case of the fractional brownian motion is discussed

on stratonovich and skorohod stochastic calculus for gaussian processes in this article we derive a stratonovich and skorohod type change of variables formula for a multidimensional gaussian process with low holder regularity typically lower than 1 4 to this aim we combine tools from rough paths theory and stochastic analysis

ramification of rough paths the stack of iterated integrals of a path is embedded in a larger algebraic structure where iterated integrals are indexed by decorated rooted trees and where an extended chen s multiplicative property involves the durr connes kreimer coproduct on rooted trees this turns out to be the natural setting for a non geometric theory of rough paths

edge fault tolerant edge bipancyclicity of balanced hypercubes abstract the balanced hypercube bh n is a variant of hypercube q n hao et al 2014 showed that there exists a fault free hamiltonian path between any two adjacent vertices in bh n with 2 n 2 faulty edges cheng et al 2015 proved that bh n is 6 edge bipancyclic after 2 n 3 faulty edges occur for all n 2 in this paper we improve these two results by demonstrating that bh n is 6 edge bipancyclic even when there exist 2 n 2 faulty edges for all n 2 our result is optimal with respect to the maximum number of tolerated edge faults

hamiltonian paths passing through prescribed edges in balanced hypercubes abstract the balanced hypercube was proposed as a novel interconnection network for large scale parallel systems it is known that the balanced hypercube is edge bipancyclic given a set of edges p with p n 1 and two vertices x and y in different bipartite sets we show that there exists a hamiltonian path from x to y passing through p in b h n if and only if p is a linear forest and neither x nor y is an internal vertex of p and x and y are not end vertices of a component of p simultaneously consequently the balanced hypercube contains a hamiltonian cycle passing through a set p of at most n prescribed edges if and only if p is a linear forest moreover our result improves some known results

matching preclusion for balanced hypercubes matching preclusion is a measure of robustness in the event of edge failure in interconnection networks the matching preclusion number of a graph g is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching and the conditional matching preclusion number of g is the minimum number of edges whose deletion leaves the resulting graph with no isolated vertices and without a perfect matching or an almost perfect matching in this paper we consider balanced hypercubes we obtain that an n dimension balanced hypercube bh n has the matching preclusion number 2n and mainly prove that for the balanced hypercube bh n each matching preclusion set of cardinality 2n is trivial and the conditional matching preclusion number of balanced hypercube is 4n 2 whenever n 2

the geometry of the space of branched rough paths we construct an explicit transitive free action of a banach space of holder functions on the space of branched rough paths which yields in particular a bijection between theses two spaces this endows the space of branched rough paths the structure of a principal homogeneous space over a banach space and allows to characterize its automorphisms the construction is based on the baker campbell hausdorff formula and on the hairer kelly map which allows to describe branched rough paths in terms of anisotropic geometric rough paths

etude de l algebre de lie double des arbres enracines decores the double lie algebra ld of rooted trees decorated by a set d is introduced generalising the construction of connes and kreimer it is shown that it is a simple lie algebra its derivations and its automorphisms are described as well as some central extensions finally the category of lowest weight modules is introduced and studied

hopf algebras renormalization and noncommutative geometry we explore the relation between the hopf algebra associated to the renormalization of qft and the hopf algebra associated to the ncg computations of tranverse index theory for foliations

vertex bipancyclicity of the generalized honeycomb tori assume that m n and s are integers with m 2 n 4 email protected s 6 and is even besides ght m n s is vertex bipancyclic in some special cases the result is optimal in the sense that the absence of cycles of certain lengths on some ght m n s s is inevitable due to their hexagonal structure

various cycles embedding in faulty balanced hypercubes consider the balanced hypercube bh n with f e 2 n 3 faulty edges prove that every edge of bh n f e lies on fault free cycles of even lengths from 6 to 22n prove that the lower limit of the length 6 is sharp quite a lot of interconnection networks are served as the underlying topologies of large scale multiprocessor systems the hypercube is one of the most popular interconnection networks in this paper we consider the balanced hypercube which is a variant of the hypercube huang and wu showed that the balanced hypercube has better properties than hypercube with the same number of links and processors let f e be the set of faulty edges in an n dimensional balanced hypercube bh n where n 2 in this paper we consider bh n with f e 2 n 3 faulty edges and prove that every fault free edge lies on a fault free cycle of every even length from 6 to 2 2 n in bh n f e furthermore we prove that the lower limit of the length 6 is sharp by giving a counter example

the intractability of resolution abstract we prove that for infinitely many disjunctive normal form propositional calculus tautologies the length of the shortest resolution proof of cannot be bounded by any polynomial of the length of the tautologies we use were introduced by cook and reckhow 1979 and encode the pigeonhole principle extended resolution can furnish polynomial length proofs of these formulas

a systematic approach for embedding of hamiltonian cycles through a prescribed edge in locally twisted cubes the locally twisted cube interconnection network has been recognized as an attractive alternative to the hypercube network previously the locally twisted cube has been shown to contain a hamiltonian cycle the main contribution of this paper is to provide the necessary and sufficient conditions for determining a characterization of permutations of link dimensions constructing hamiltonian cycles in a locally twisted cube for those permutations we propose a linear algorithm for finding a hamiltonian cycle through a given edge as a result we obtain a lower bound for the number of hamiltonian cycles through a given edge in an n dimensional locally twisted cube