Eventually cyclic spectra of parameterized flows.

Kennison, John F.

Displaying similar documents to “Eventually cyclic spectra of parameterized flows.”

Conjunctively polynomial-like Boolean functions.

Gonda, J. (2007)

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]

Similarity:

$2 k n - (\binom{2 k + 1}{2})$ . A note on extremal combinatorics of cyclic split systems.

Dress, A., Klucznik, M., Koolen, J., Moulton, V. (2001)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

The classification of tiling space flows.

Clark, Alex (2003)

Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica

Similarity:

Cellularity of free products of Boolean algebras (or topologies)

Saharon Shelah (2000)

Fundamenta Mathematicae

Similarity:

The aim this paper is to present an answer to Problem 1 of Monk [10], [11]. We do this by proving in particular that if μ is a strong limit singular cardinal, $θ = {(2^{c f (μ)})}^{+}$ and $2^{μ} = μ^{+}$ then there are Boolean algebras $𝔹_{1}, 𝔹_{2}$ such that $c (𝔹_{1}) = μ, c (𝔹_{2}) < θ b u t c (𝔹_{1} * 𝔹_{2}) = μ^{+}$ . Further we improve this result, deal with the method and the necessity of the assumptions. In particular we prove that if $𝔹$ is a ccc Boolean algebra and $μ^{ℶ_{ω}} \leq λ = c f (λ) \leq 2^{μ}$ then $𝔹$ satisfies the λ-Knaster condition (using the “revised GCH theorem”).

Stability of the 4-2 Binary Addition Circuit Cells. Part I

Katsumi Wasaki (2008)

Formalized Mathematics

Similarity:

To evaluate our formal verification method on a real-size calculation circuit, in this article, we continue to formalize the concept of the 4-2 Binary Addition Cell primitives (FTAs) to define the structures of calculation units for a very fast multiplication algorithm for VLSI implementation [11]. We define the circuit structure of four-types FTAs, TYPE-0 to TYPE-3, using the series constructions of the Generalized Full Adder Circuits (GFAs) that generalized adder to have for each positive...

Prenormality of ideals and completeness of their quotient algebras

A. Morawiec, B. Węglorz (1993)

Colloquium Mathematicae

Similarity:

It is well known that if a nontrivial ideal ℑ on κ is normal, its quotient Boolean algebra P(κ)/ℑ is $κ^{+}$ -complete. It is also known that such completeness of the quotient does not characterize normality, since P(κ)/ℑ turns out to be $κ^{+}$ -complete whenever ℑ is prenormal, i.e. whenever there exists a minimal ℑ-measurable function in $^{κ} κ$ . Recently, it has been established by Zrotowski (see [Z1], [CWZ] and [Z2]) that for non-Mahlo κ, not only is the above condition sufficient but also necessary...

On strongly $(P)$ -cyclic acts

Akbar Golchin, Parisa Rezaei, Hossein Mohammadzadeh (2009)

Czechoslovak Mathematical Journal

Similarity:

By a regular act we mean an act such that all its cyclic subacts are projective. In this paper we introduce strong $(P)$ -cyclic property of acts over monoids which is an extension of regularity and give a classification of monoids by this property of their right (Rees factor) acts.

Continuous and inverse shadowing for flows.

Kościelniak, Piotr (2003)

Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica

Similarity:

On strongly Hausdorff flows

Hiromichi Nakayama (1996)

Fundamenta Mathematicae

Similarity:

A flow of an open manifold is very complicated even if its orbit space is Hausdorff. In this paper, we define the strongly Hausdorff flows and consider their dynamical properties in terms of the orbit spaces. By making use of this characterization, we finally classify all the strongly Hausdorff $C^{1}$ -flows.

Global stability of dynamic systems of high order.

Benalili, Mohammed, Lansari, Azzedine (2007)

SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]

Similarity:

Analysis of Algorithms: An Example of a Sort Algorithm

Grzegorz Bancerek (2013)

Formalized Mathematics

Similarity:

We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exchanging in terms of program algebra over an algebra.