نتایج جستجو برای: periodic and cyclic flows

تعداد نتایج: 16874743  

Journal: :SIAM J. Math. Analysis 2014
Jack Xin Yifeng Yu

The study of turbulent flame speeds (the large time front speeds) is a fundamental problem in turbulent combustion theory. A significant project is to understand how the turbulent flame speed (sT ) depends on the flow intensity (A). G-equation is a very popular level set flame propagation model in turbulent combustion community. The main purpose of this paper is to study properties of limA→+∞ s...

Journal: :Journal of the European Mathematical Society 2017

1999
Jacek BRODZKI

Relying on properties of the inductive tensor product, we construct cyclic type homology theories for certain nuclear algebras. In this context, we establish continuity theorems. We compute the periodic cyclic homology of the Schwartz algebra of p-adic GL(n) in terms of compactly supported de Rham cohomology of the tempered dual of GL(n). 1. Complete nuclear locally convex algebras Cyclic type ...

Journal: :Philosophical transactions of the Royal Society of London. Series B, Biological sciences 1975
G Gerisch D Hülser D Malchow U Wick

At the surface of aggregating cells of the slime mould, Dictyostelium discoideum, two different sites interacting with extracellular cAMP are detectable: binding sites and cycl-nucleotide phosphodiesterase. Both sites are developmentally regulated. An adequate stimulus for the chemoreceptor system in D. discoideum is the change of cAMP concentration in time, rather than concentration per se: lo...

Journal: :Math. Oper. Res. 1984
James B. Orlin

This paper presents and solves in polynomial time the minimum convex cost dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which each arc has an associated transit time for flow to pass through it. An integral amount of flow is to be sent through arcs of the network in each period over...

Journal: :J. Comb. Theory, Ser. A 2014
Julien Cassaigne Gabriele Fici Marinella Sciortino Luca Q. Zamboni

We introduce and study a new complexity function on words, that we call cyclic complexity, which counts the number of conjugacy classes of factors of each given length. We extend the famous MorseHedlund theorem to the setting of cyclic complexity by showing that a word is ultimately periodic if and only if it has bounded cyclic complexity. Unlike most complexity functions, cyclic complexity dis...

Journal: :Journal of Noncommutative Geometry 2009

Journal: :Transactions of the American Mathematical Society 1972

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید