Application of Hankel transforms to boundary value problems of water flow due to a circular source

With the aid of Hankel transform technique, we obtain close-form solutions for discontinuous boundary-condition problems of water flow due to a circular source, which located on the upper surface of a confined aquifer. Owing to difficult evaluations of the original solutions that are in a form of an infinite range integral with a singular point and Bessel functions in integrands, we adopt two numerical algorisms to transform the original solutions as a series form for convenient practical applications. We apply the solutions in series form to numerical examples to analyze the characteristics of the flow in the confined aquifers subjected to pumping or recharge. By numerical examples, it indicates that: the drawdown will reduce with the increase of the layer thickness and the distance from the center of a circular source when pumping in a region with a finite thickness and a finite width; two algorisms for closed-form solutions of an infinite range integral have almost the same results, but the second algorism is superior for a faster convergence; in a semi-infinite confined aquifer, the drawdown due to a constant pumping rate Q and uplift due to recharge by a given hydraulic head s₀ will both decrease with the increase of K_r/K_v; however, the radius r₀ of the circular source has a reverse influence on the drawdown and the uplift, i.e., the drawdown decrease with the increase of r₀, while the uplift increase with r₀.     

The rational canonical form via the splitting field

It is clear that a given rational canonical form can be further resolved to a Jordan canonical form with entries from the splitting field of its minimal polynomial. Conversely, with an a priori knowledge of the existence and uniqueness of the rational canonical form of a matrix with entries from a general field, one can modify its Jordan canonical form in the splitting field of its minimal polynomial to construct its rational canonical form in the original field. No author has tried this converse with the a priori existence–uniqueness condition removed. It is feared that “in many occasions when, after a result has been established for a matrix with entries in a given field, considered as a matrix with entries in a finite extension of that field, we cannot go back from the extension field to get the desired information in the original field” [I.N. Herstein, Topics in Algebra, Ginn and Company, Waltham, MA, 1964 (pp. 262–263)]. The present paper removes this a priori condition and uses a “symmetrization” to “integrate” back the Jordan canonical form of a matrix to its rational canonical form in the original field.     

Schlicht Envelopes of Holomorphy and Foliations by Lines

Given a domain Y in a complex manifold X, it is a difficult problem with no general solution to determine whether Y has a schlicht envelope of holomorphy in X, and if it does, to describe the envelope. The purpose of this paper is to tackle the problem with the help of a smooth 1-dimensional foliation ℱ of X with no compact leaves. We call a domain Y in X an interval domain with respect to ℱ if Y intersects every leaf of ℱ in a nonempty connected set. We show that if X is Stein and if ℱ satisfies a new property called quasiholomorphicity, then every interval domain in X has a schlicht envelope of holomorphy, which is also an interval domain. This result is a generalization and a global version of a well-known lemma from the mid-1980s. We illustrate the notion of quasiholomorphicity with sufficient conditions, examples, and counterexamples, and present some applications, in particular to a little-studied boundary regularity property of domains called local schlichtness.      

Some Applications of a Bombieri-Type Theoremin Totally Real Number Fields

 The primary concern of this paper is to present three further applications of a multi-dimensional version of Bombieri’s theorem on primes in arithmetic progressions in the setting of a totally real algebraic number field K. First, we deal with the order of magnitude of a greatest (relative to its norm) prime ideal factor of , where the product runs over prime arguments ω of a given irreducible polynomial F which lie in a certain lattice point region. Then, we turn our attention to the problem about the occurrence of algebraic primes in a polynomial sequence generated by an irreducible polynomial of K with prime arguments. Finally, we give further contributions to the binary Goldbach problem in K.     

General Class of Implicit Variational Inclusions and Graph Convergence on <Emphasis Type="Italic">A</Emphasis>-Maximal Relaxed Monotonicity

Based on the generalized graph convergence, first a general framework for an implicit algorithm involving a sequence of generalized resolvents (or generalized resolvent operators) of set-valued A-maximal monotone (also referred to as A-maximal (m)-relaxed monotone, and A-monotone) mappings, and H-maximal monotone mappings is developed, and then the convergence analysis to the context of solving a general class of nonlinear implicit variational inclusion problems in a Hilbert space setting is examined. The obtained results generalize the work of Huang, Fang and Cho (in J. Nonlinear Convex Anal. 4:301–308, 2003) involving the classical resolvents to the case of the generalized resolvents based on A-maximal monotone (and H-maximal monotone) mappings, while the work of Huang, Fang and Cho (in J. Nonlinear Convex Anal. 4:301–308, 2003) added a new dimension to the classical resolvent technique based on the graph convergence introduced by Attouch (in Variational Convergence for Functions and Operators, Applied Mathematics Series, Pitman, London 1984). In general, the notion of the graph convergence has potential applications to several other fields, including models of phenomena with rapidly oscillating states as well as to probability theory, especially to the convergence of distribution functions on ℜ. The obtained results not only generalize the existing results in literature, but also provide a certain new approach to proofs in the sense that our approach starts in a standard manner and then differs significantly to achieving a linear convergence in a smooth manner.     

Models and heuristic algorithms for a weighted vertex coloring problem

We consider a weighted version of the well-known Vertex Coloring Problem (VCP) in which each vertex i of a graph G has associated a positive weight w _i . Like in VCP, one is required to assign a color to each vertex in such a way that colors on adjacent vertices are different, and the objective is to minimize the sum of the costs of the colors used. While in VCP the cost of each color is equal to one, in the Weighted Vertex Coloring Problem (WVCP) the cost of each color depends on the weights of the vertices assigned to that color, and it equals the maximum of these weights. WVCP is known to be NP-hard and arises in practical scheduling applications, where it is also known as Scheduling on a Batch Machine with Job Compatibilities. We propose three alternative Integer Linear Programming (ILP) formulations for WVCP: one is used to derive, dropping integrality requirement for the variables, a tight lower bound on the solution value, while a second one is used to derive a 2-phase heuristic algorithm, also embedding fast refinement procedures aimed at improving the quality of the solutions found. Computational results on a large set of instances from the literature are reported.     

Duality for optimization and best approximation over finite intersections

Recently Deutsch, Li and Swetits [2] have studied, in Hilbert space, a dual problem (Q_m ) to the primal problem (P) of minimization of a special class of convex functions f over the intersection of m closed convex sets, where m is finite. In the first part of this paper we obtain, in a locally convex space, some results on problem (Q_m ) and on its relations with the usual Lagrangian dual problem (Q) to (P) (studied in [9]), in the case when (P) has a solution. In the second part we give some applications to duality for the distance to the intersection of m closed convex sets in a normed linear space, in the case when a nearest point exists. Most of our results seem to be new even in the particular cases studied in [9] (the case m = 1), [l] (duality formulas for the distance to the intersection of m closed half-spaces in a normed linear space) and [2].     

Initial-value problems for linear partial difference equations

The method presented in [4] for the solution of linear difference equations in a single variable is extended to some equations in two variables. Every linear combination of a given functionf and of its partial differences can be obtained by the discrete convolution product off by a suitable functionl (which depends on the considered linear combination), and we want to solve in a convolutional form difference equations in the whole plane. However, the convolution of two functions may not be possible if their supports contain half straight lines with opposite directions. To avoid this, we take four sets of functions corresponding to the quadrants such thatl belong to every set, every set endowed with the convolution and with the usual addition is a ring, and there is an inverse ofl in each of the four rings. This is attained by taking, for each ring, a set of functions whose supports belong to suitable cones. After choosing such rings, a very natural initial-value first-order Cauchy Problem (in partial differences) is reduced to a convolutional form. This is done either by a direct method or by introducing the forward difference functions _i f(i=1,2) in a general way depending on the shape of the support off so that Laplace-like formulas with initial and final values) hold. Applications to difference equations in the whole plane and to partial differential problems are made.     

Using scatterplots to understand and improve probabilistic models for text categorization and retrieval

The two-dimensional representation of documents which allows documents to be represented in a two-dimensional Cartesian plane has proved to be a valid visualization tool for Automated Text Categorization (ATC) for understanding the relationships between categories of textual documents, and to help users to visually audit the classifier and identify suspicious training data. This paper analyzes a specific use of this visualization approach in the case of the Naive Bayes (NB) model for text classification and the Binary Independence Model (BIM) for text retrieval. For text categorization, a reformulation of the equation for the decision of classification has to be written in such a way that each coordinate of a document is the sum of two addends: a variable component P(d|c_i), and a constant component P(c_i), the prior of the category. When plotted in the Cartesian plane according to this formulation, the documents that are constantly shifted along the x-axis and the y-axis can be seen. This effect of shifting is more or less evident according to which NB model, Bernoulli or multinomial, is chosen. For text retrieval, the same reformulation can be applied in the case of the BIM model. The visualization helps to understand the decisions that are taken to order the documents, in particular in the case of relevance feedback.     

Proof and refutation in MALL as a game

We present a setting in which the search for a proof of B or a refutation of B (i.e., a proof of ¬B) can be carried out simultaneously: in contrast, the usual approach in automated deduction views proving B or proving ¬B as two, possibly unrelated, activities. Our approach to proof and refutation is described as a two-player game in which each player follows the same rules. A winning strategy translates to a proof of the formula and a counter-winning strategy translates to a refutation of the formula. The game is described for multiplicative and additive linear logic (MALL). A game theoretic treatment of the multiplicative connectives is intricate and our approach to it involves two important ingredients. First, labeled graph structures are used to represent positions in a game and, second, the game playing must deal with the failure of a given player and with an appropriate resumption of play. This latter ingredient accounts for the fact that neither player might win (that is, neither B nor ¬B might be provable).     

On some methods of deriving geometric expectation

Formulas presented for the calculation of ∑ _j=1 ⁿ j^k (n, k ∈ N do not have a closed form; they are in the form of recursive or complex formulas. Here an attempt is made to present a simple formula in which it is only necessary to compute the numerical coefficients in a recursive form, and the coefficients in turn follow a simple pattern (almost similar to Pascal's Triangle). Although the pattern for calculating numerical coefficients based on forming a table is easy, non-recursive formulas are presented to determine the numerical coefficients.     

On the convergence to the multiple Wiener-Itô integral

We study the convergence to the multiple Wiener-Itô integral from processes with absolutely continuous paths. More precisely, consider a family of processes, with paths in the Cameron-Martin space, that converges weakly to a standard Brownian motion in C₀([0,T]). Using these processes, we construct a family that converges weakly, in the sense of the finite dimensional distributions, to the multiple Wiener-Itô integral process of a function f∈L²(n[0,T]). We prove also the weak convergence in the space C₀([0,T]) to the second-order integral for two important families of processes that converge to a standard Brownian motion.     

The Eckmann-Hilton argument and higher operads

The classical Eckmann-Hilton argument shows that two monoid structures on a set, such that one is a homomorphism for the other, coincide and, moreover, the resulting monoid is commutative. This argument immediately gives a proof of the commutativity of the higher homotopy groups. A reformulation of this argument in the language of higher categories is: suppose we have a one object, one arrow 2-category, then its Hom-set is a commutative monoid. A similar argument due to A. Joyal and R. Street shows that a one object, one arrow tricategory is ‘the same’ as a braided monoidal category.In this paper we begin to investigate how one can extend this argument to arbitrary dimension. We provide a simple categorical scheme which allows us to formalise the Eckmann-Hilton type argument in terms of the calculation of left Kan extensions in an appropriate 2-category. Then we apply this scheme to the case of n-operads in the author's sense and classical symmetric operads. We demonstrate that there exists a functor of symmetrisation Symn from a certain subcategory of n-operads to the category of symmetric operads such that the category of one object, one arrow, … , one (n−1)-arrow algebras of A is isomorphic to the category of algebras of Symn(A). Under some mild conditions, we present an explicit formula for Symn(A) which involves taking the colimit over a remarkable categorical symmetric operad.We will consider some applications of the methods developed to the theory of n-fold loop spaces in the second paper of this series.     

Existence of zerofree functions N-associated to a de Branges Pontryagin space

In the theory of de Branges Hilbert spaces of entire functions, so-called ‘functions associated to a space’ play an important role. In the present paper we deal with a generalization of this notion in two directions, namely with functions N-associated (N ? \mathbb Z)({N \in\mathbb {Z}}) to a de Branges Pontryagin space. Let a de Branges Pontryagin space P{\mathcal {P}} and N ? \mathbb Z{N \in \mathbb {Z}} be given. Our aim is to characterize whether there exists a real and zerofree function N-associated to P{\mathcal {P}} in terms of Kreĭn’s Q-function associated with the multiplication operator in P{\mathcal {P}} . The conditions which appear in this characterization involve the asymptotic distribution of the poles of the Q-function plus a summability condition. Although this question may seem rather abstract, its answer has a variety of nontrivial consequences. We use it to answer two questions arising in the theory of general (indefinite) canonical systems. Namely, to characterize whether a given generalized Nevanlinna function is the intermediate Weyl-coefficient of some system in terms of its poles and residues, and to characterize whether a given general Hamiltonian ends with a specified number of indivisible intervals in terms of the Weyl-coefficient associated to the system. In addition, we present some applications, e.g., dealing with admissible majorants in de Branges spaces or the continuation problem for hermitian indefinite functions.     

A group based solution strategy for multi-physics simulations in parallel

Multi-physics simulation often requires the solution of a suite of interacting physical phenomena, the nature of which may vary both spatially and in time. For example, in a casting simulation there is thermo-mechanical behaviour in the structural mould, whilst in the cast, as the metal cools and solidifies, the buoyancy induced flow ceases and stresses begin to develop. When using a single code to simulate such problems it is conventional to solve each ‘physics’ component over the whole single mesh, using definitions of material properties or source terms to ensure that a solved variable remains zero in the region in which the associated physical phenomenon is not active. Although this method is secure, in that it enables any and all the ‘active’ physics to be captured across the whole domain, it is computationally inefficient in both scalar and parallel. An alternative, known as the ‘group’ solver approach, involves more formal domain decomposition whereby specific combinations of physics are solved for on prescribed sub-domains. The ‘group’ solution method has been implemented in a three-dimensional finite volume, unstructured mesh multi-physics code, which is parallelised, employing a multi-phase mesh partitioning capability which attempts to optimise the load balance across the target parallel HPC system. The potential benefits of the ‘group’ solution strategy are evaluated on a class of multi-physics problems involving thermo-fluid–structural interaction on both a single and multi-processor systems. In summary, the ‘group’ solver is a third faster on a single processor than the single domain strategy and preserves its scalability on a parallel cluster system.     

An ‘Emergent Model’ for Rate of Change

Does speed provide a ‘model for’ rate of change in other contexts? Does JavaMathWorlds (JMW), animated simulation software, assist in the development of the ‘model for’ rate of change? This project investigates the transference of understandings of rate gained in a motion context to a non-motion context. Students were 27 14–15 year old students at an Australian secondary school. The instructional sequence, utilising JMW, provided rich learning experiences of rate of change in the context of a moving elevator. This context connects to students’ prior knowledge. The data taken from pre- and post-tests and student interviews revealed a wide variation in students’ understanding of rate of change. The variation was mapped on a hypothetical learning trajectory and interpreted in the terms of the ‘emergent models’ theory (Gravemeijer, Math Think Learn 1(2):155–177, 1999) and illustrated by specific examples from the data. The results demonstrate that most students were able to use the ‘model of’ rate of change developed in a vertical motion context as a ‘model for’ rate of change in a horizontal motion context. A smaller majority of students were able to use their, often incomplete, ‘model of’ rate of change as a ‘model for’ reasoning about rate of change in a non-motion context.     

Convex duality and the Skorokhod Problem. I

The solution to the Skorokhod Problem defines a deterministic mapping, referred to as the Skorokhod Map, that takes unconstrained paths to paths that are confined to live within a given domain G⊂ℝ ⁿ . Given a set of allowed constraint directions for each point of ∂G and a path ψ, the solution to the Skorokhod Problem defines the constrained version φ of ψ, where the constraining force acts along one of the given boundary directions using the “least effort” required to keep φ in G. The Skorokhod Map is one of the main tools used in the analysis and construction of constrained deterministic and stochastic processes. When the Skorokhod Map is sufficiently regular, and in particular when it is Lipschitz continuous on path space, the study of many problems involving these constrained processes is greatly simplified. We focus on the case where the domain G is a convex polyhedron, with a constant and possibly oblique constraint direction specified on each face of G, and with a corresponding cone of constraint directions at the intersection of faces. The main results to date for problems of this type were obtained by Harrison and Reiman [22] using contraction mapping techniques. In this paper we discuss why such techniques are limited to a class of Skorokhod Problems that is a slight generalization of the class originally considered in [22]. We then consider an alternative approach to proving regularity of the Skorokhod Map developed in [13]. In this approach, Lipschitz continuity of the map is proved by showing the existence of a convex set that satisfies a set of conditions defined in terms of the data of the Skorokhod Problem. We first show how the geometric condition of [13] can be reformulated using convex duality. The reformulated condition is much easier to verify and, moreover, allows one to develop a general qualitative theory of the Skorokhod Map. An additional contribution of the paper is a new set of methods for the construction of solutions to the Skorokhod Problem. These methods are applied in the second part of this paper [17] to particular classes of Skorokhod Problems. Received: 17 April 1998 / Revised version: 8 January 1999     

On the Finsler-metrizabilities of spray manifolds

In this essentially selfcontained paper first we establish an intrinsic version and present a coordinate-free deduction of the so-called Rapcsák equations, which provide, in the form of second order PDE-s, necessary and sufficient conditions for a Finsler structure to be projectively related to a spray. From another viewpoint, the Rapcsák equations are the conditions for the Finsler-metrizability of a spray in a broad sense. Second, we give a reformulation in terms of 0-homogeneous Hilbert 1-forms of both this and another metrizability problem, called Finsler-metrizability in a natural sense. (The latter is just a Finslerian version of the classical inverse problem of the calculus of variations.) Finally, in our main theorem we provide a reduction of the Rapcsák equations to a first order PDE with an algebraic condition. The preparatory parts of the paper are devoted to a careful elaboration of the necessary technical tools, while in an Appendix the computational background is summarized.     

Stable Comparison of Multidimensional Persistent Homology Groups with Torsion

The present lack of a stable method to compare persistent homology groups with torsion is a relevant problem in current research about Persistent Homology and its applications in Pattern Recognition. In this paper we introduce a pseudo-distance d _T that represents a possible solution to this problem. Indeed, d _T is a pseudo-distance between multidimensional persistent homology groups with coefficients in an Abelian group, hence possibly having torsion. Our main theorem proves the stability of the new pseudo-distance with respect to the change of the filtering function, expressed both with respect to the max-norm and to the natural pseudo-distance between topological spaces endowed with ? ⁿ -valued filtering functions. Furthermore, we prove a result showing the relationship between d _T and the matching distance in the 1-dimensional case, when the homology coefficients are taken in a field and hence the comparison can be made.     

Stochastic approximation of Banach-valued random variables with smooth distributions

A random variablef taking values in a Banach spaceE is estimated from another Banach-valued variableg. The best (with respect to theL _p-metrix) estimator is proved to exist in the case of Bochnerp-integrable variables. For a Hilbert spaceE andp=2, the best estimator is expressed in terms of the conditional expectation and, in the case of jointly Gaussian variables, in terms of the orthoprojection on a certain subspace ofE. More explicit expressions in terms of surface measures are given for the case in which the underlying probability space is a Hilbert space with a smooth probability measure. The results are applied to the Wiener process to improve earlier estimates given by K. Ritter [4]. Translated fromMatematicheskie Zametki, Vol. 58, No. 3, pp. 425–444, September, 1995. The author is grateful to B. S. Kashin for posing the problem and helping to write the article, and to the reviewer for a number of useful remarks.