Commuting Flows and Infinite-Dimensional Tori: Sine-Gordon

The present work concerns the periodic sine-Gordon equation. We explain why the complete set of conserved functionals for sine-Gordon is an infinite-dimensional torus; the periodic sine-Gordon solution is almost periodic in time on an infinite-dimensional torus.     

Nonlinear Transformations of Smooth Measures on Infinite-Dimensional Spaces

We investigate the properties of the image of a differentiable measure on an infinitely-dimensional Banach space under nonlinear transformations of the space. We prove a general result concerning the absolute continuity of this image with respect to the initial measure and obtain a formula for density similar to the Ramer–Kusuoka formula for the transformations of the Gaussian measure. We prove the absolute continuity of the image for classes of transformations that possess additional structural properties, namely, for adapted and monotone transformations, as well as for transformations generated by a differential flow. The latter are used for the realization of the method of characteristics for the solution of infinite-dimensional first-order partial differential equations and linear equations with an extended stochastic integral with respect to the given measure.     

Balancing Transformations for Infinite-Dimensional Control Systems

In order to facilitate model reduction by balanced truncation, we introduce state space transformations that can be used to construct an ℓ₂-balanced realization of a regular, linear input-ouput map with nuclear Hankel-operator directly from the system generators of an arbitrary, given realization. These balancing transformations are based on factors of the Gramians and, for infinite-dimensional systems, they are usually unbounded operators. Subsequently the ℓ₂-balanced realization can be truncated in a non-trivial way to obtain an approximating, finite-dimensional model. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the Fréchet Differentiability of Invariant Tori of Countable Systems of Difference Equations Defined on Infinite-Dimensional Tori

By using the method of Green–Samoilenko functions, in the space of bounded number sequences we construct invariant tori of linear and nonlinear systems of discrete equations defined on infinite-dimensional tori. We establish sufficient conditions for the Fréchet differentiability of invariant tori.     

Balancing Transformations for Infinite-Dimensional Systems with Nuclear Hankel Operator

We consider balancing and model reduction by balanced truncation for infinite-dimensional linear systems. A functional analytic approach to state space transformations leading to balanced realizations is presented. These transformations can be further used to explicitly construct truncated balanced realizations. The presented approach is applicable to bounded well-posed linear systems with nuclear Hankel operator and finite-dimensional input and output space. Controllability and observability are not required.     

On the Discrepancy for Cartesian Products

Let B₂ denote the family of all circular discs in the plane.It is proved that the discrepancy for the family {B₁ x B₂ :B₁, B₂ B₂} in R⁴ is O(n^1/4+) for an arbitrarily small constant > 0, that is, it is essentially the same as that for thefamily B₂ itself. The result is established for the combinatorialdiscrepancy, and consequently it holds for the discrepancy withrespect to the Lebesgue measure as well. This answers a questionof Beck and Chen. More generally, we prove an upper bound forthe discrepancy for a family {^k_i=1A_i:A_iA_i, i = 1, 2, ..., k},where each A_i is a family in R^d_i, each of whose sets is describedby a bounded number of polynomial inequalities of bounded degree.The resulting discrepancy bound is determined by the ‘worst’of the families A_i, and it depends on the existence of certaindecompositions into constant-complexity cells for arrangementsof surfaces bounding the sets of A_i. The proof uses Beck's partialcoloring method and decomposition techniques developed for therange-searching problem in computational geometry.     

笛卡尔乘积图的成对控制

Let γpr（G） denote the paired domination number and G □ H denote the Cartesian product of graphs G and H. In this paper we show that for all graphs G and H without isolated vertex, γpr（G）γpr（H）≤ 7γpr （G □H）.     

Cartesian Closed Topological Categories and Tensor Products

The projective tensor product in a category of topological R-modules (where R is a topological ring) can be defined in Top, the category of topological spaces, by the same universal property used to define the tensor product of R-modules in Set. In this article, we extend this definition to an arbitrary topological category X and study how the Cartesian closedness of X is related to the monoidal closedness of the category of R-module objects in X. Mathematics Subject Classifications (2000) 18D15, 18D35, 18A40.     

树的笛卡儿积的测地数

图G内的任意两点u和υ,u-υ测地线是指u和υ之间的最短路.I(u,υ)表示位于u一υ测地线上所有点的集合,对于子集S∈V(G),I(s)表示所有,(u,υ)的并,这里u,υ∈S.图G的测地数g(G)是使,I(s):V(G)的点集S的最小基数.本文研究了任意连通图G与树T笛卡儿积的测地数的界,同时,给出了任意两个树T1与T2笛卡儿积的测地数和树T与圈C笛卡儿积的测地数.     

Treewidth of Cartesian Products of Highly Connected Graphs

The following theorem is proved: for all k‐connected graphs G and H each with at least n vertices, the treewidth of the cartesian product of G and H is at least . For , this lower bound is asymptotically tight for particular graphs G and H. This theorem generalizes a well‐known result about the treewidth of planar grid graphs.     

On Optimal Orientations of Cartesian Products of Trees

. Let d(D) (resp., d(G)) denote the diameter and r(D) (resp., r(G)) the radius of a digraph D (resp., graph G). Let G×H denote the cartesian product of two graphs G and H. An orientation D of G is said to be (r, d)-invariant if r(D)=r(G) and d(D)=d(G). Let {T _i }, i=1,…,n, where n≥2, be a family of trees. In this paper, we show that the graph ∏ _{i =1} ⁿ T _i admits an (r, d)-invariant orientation provided that d(T ₁)≥d(T ₂)≥4 for n=2, and d(T ₁)≥5 and d(T ₂)≥4 for n≥3. Received: July 30, 1997 Final version received: April 20, 1998     

图的笛卡儿积的测地数

对于图G内的任意两点u和v，u-v测地线是指u和v之间的最短路．I（u，v）表示位于u-v测地线上所有点的集合，对于．S∈V（G），I（S）表示所有I（u，v）的并，这里“u,v∈．S．G的测地数g（G）是使I（S）=V（G）的点集．S的最小基数．在这篇文章，我们研究G×K3的测地数和g（G）与g（G×K3）相等的充分必要条件，还给出了T×Km和Cn×Km的测地数，这里T是树．     

乘积图的Fractional控制

Let G =(V,E) be a simple graph.For any real function g :V-→ R and a subset S V,we write g(S) =∑v∈Sg(v).A function f :V-→ [0,1] is said to be a fractional dominating function(F DF) of G if f(N [v]) ≥ 1 holds for every vertex v ∈ V(G).The fractional domination number γf(G) of G is defined as γf(G) = min{f(V)|f is an F DF of G }.The fractional total dominating function f is defined just as the fractional dominating function,the difference being that f(N(v)) ≥ 1 instead of f(N [v]) ≥ 1.The fractional total domination number γ0f(G) of G is analogous.In this note we give the exact values ofγf(Cm × Pn) and γ0f(Cm × Pn) for all integers m ≥ 3 and n ≥ 2.     

Nilpotent extensions of Furstenberg transformations

We study topologically recurrent cocycles of a class of minimal homeomorphisms on tori, usually called Furstenberg transformations, and with values in nilpotent locally compact second countable groups. We prove that these cocycles fulfil a regularity property and admit a partitioning of the skew product into orbit closures.     

On the Total Domination Number of Cartesian Products of Graphs

The most famous open problem involving domination in graphs is Vizings conjecture which states the domination number of the Cartesian product of any two graphs is at least as large as the product of their domination numbers. In this paper, we investigate a similar problem for total domination. In particular, we prove that the product of the total domination numbers of any nontrivial tree and any graph without isolated vertices is at most twice the total domination number of their Cartesian product, and we characterize the extremal graphs.Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal     

On Computability Theoretic Properties of Structures and Their Cartesian Products

In this paper we show that for any set X ⊆ ω there exists a structure 𝒜 that has no presentation computable in X such that 𝒜² has a computable presentation. We also show that there exists a structure 𝒜 with infinitely many computable isomorphism types such that 𝒜² has exactly one computable isomorphism type.