χ‐bounds,operations, and chords

A long unichord in a graph is an edge that is the unique chord of some cycle of length at least 5. A graph is long unichord free if it does not contain any long unichord. We prove a structure theorem for long unichord free graph. We give an time algorithm to recognize them. We show that any long unichord free graph G can be colored with at most colors, where ω is the maximum number of pairwise adjacent vertices in G.     

Explicit hybrid six–step,sixth order,fully symmetric methods for solving y ″ = f (x,y)

A family of explicit, fully symmetric, sixth order, six‐step methods for the numerical solution of y′′ = f(x,y) is studied. This family wastes two function evaluations per step and can be derived through interpolation techniques. An interval of periodicity is possessed and the phase lag is of high order. Numerical instabilities usually present in such type of multistep methods were circumvented. We conclude with extended numerical tests over a set of problems justifying our effort of dealing with the new methods.     

Family of Pearson discrete distributions generated by the univariate hypergeometric function 3F2(α1, α2, α3; γ1, γ2; λ)

In this work we present a study of the Pearson discrete distributions generated by the hypergeometric function ₃F₂(α₁, α₂, α₃;γ₁, γ₂; λ), a univariate extension of the Gaussian hypergeometric function, through a constructive methodology. We start from the polynomial coefficients of the difference equation that lead to such a function as a solution. Immediately after, we obtain the generating probability function and the differential equation that it satisfies, valid for any admissible values of the parameters. We also obtain the differential equations that satisfy the cumulants generating function, moments generating function and characteristic function, From this point on, we obtain a relation in recurrences between the moments about the origin, allowing us to create an equation system for estimating the parameters by the moment method. We also establish a classification of all possible distributions of such type and conclude with a summation theorem that allows us study some distributions belonging to this family. © 1997 by John Wiley & Sons, Ltd.     

Two constructions of (v, (v − 1)/2, (v − 3)/2) difference families

In this article, two constructions of (v, (v ? 1)/2, (v ? 3)/2) difference families are presented. The first construction produces both cyclic and noncyclic difference families, while the second one gives only cyclic difference families. The parameters of the second construction are new. The difference families presented in this article can be used to construct Hadamard matrices. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 164–171, 2008     

A model of professional competences in mathematics to update mathematical and didactic knowledge of teachers

This paper describes part of a research and development project carried out in public elementary schools. Its objective was to update the mathematical and didactic knowledge of teachers in two consecutive levels in urban and rural public schools of Region de Los Lagos and Region de Los Rios of southern Chile. To that effect, and by means of an advanced training project based on a professional competences model, didactic interventions based on types of problems and types of mathematical competences with analysis of contents and learning assessment were designed. The teachers’ competence regarding the didactic strategy used and its results, as well as the students’ learning achievements are specified. The project made possible to validate a strategy of lifelong improvement in mathematics, based on the professional competences of teachers and their didactic transposition in the classroom, as an alternative to consolidate learning in areas considered vulnerable in two regions of the country.     

Behaviour of (−Δ−k2−i0+)−1 outside fading obstacles,independant scattering hypothesis and applications

This paper deals with the behaviour of k‐outgoing solutions of ?Δu?k²u=f outside a fading soft obstacle. We extend an approach using the so‐called Lax–Phillips construction and the well‐known properties of the capacity of smooth obstacles. So, classical results are recovered in a straightforward manner. The previous approach enables us to consider the case of obstacles composed of many tiny spheres. Roughly speaking, we prove that the scattering amplitude is approximately the sum of the scattering amplitudes scattered by each isolated sphere, which is an alternative form of the first Born approximation. As a consequence, two inverse problems are solved. Copyright © 2003 John Wiley & Sons, Ltd.     

Nonsymmetric 2‐(v,k,λ) designs,with (r,λ) = 1, admitting a solvable flag‐transitive automorphism group of affine type

Nonsymmetric $2‐\left(v,k,\lambda \right)$ designs, with $\left(r,\lambda \right)=1$, admitting a solvable flag‐transitive automorphism group of affine type not contained in $A\mathrm{\Gamma }{L}_1\left(v\right)$ are classified.     

Phase‐fitted,six‐step methods for solving x′′ = f(t,x)

An explicit, six‐step method of sixth order is presented and tuned for the numerical solution of x′′ = f(t,x). This method is explicit, hybrid, and uses two function evaluations (stages) per step. Its coefficients are varied and depend on the step size. This variance comes from the demand of the method to nullify the phase errors produced when solving the standard simple oscillator. The first and second derivative of this error vanish also. Numerical tests in a set of relevant problems illustrate the efficiency of the newly derived method.     

Non-recursive functions,knots “with thick ropes,” and self-clenching “thick” hyperspheres

We introduce an approach to certain geometric variational problems based on the use of the algorithmic unrecognizability of the n-dimensional sphere for n ≥ 5. Sometimes this approach allows one to prove the existence of infinitely many solutions of a considered variational problem. This recursion-theoretic approach is applied in this paper to a class of functionals on the space of C^1.1-smooth hypersurfaces diffeomorphic to Sⁿ in Rⁿ⁺¹, where n is any fixed number ≥ 5. The simplest of these functionals k_v is defined by the formula k_v(Σⁿ) = (vol(Σⁿ))^1/n/r(Σⁿ), where r(Σⁿ) denotes the radius of injectivity of the normal exponential map for Σⁿ ? Rⁿ+l. We prove the existence of an infinite set of distinct locally minimal values of k_v on the space of C^1.1-smooth topological hyperspheres in Rⁿ⁺¹ for any n ≥ 5. The functional k_v naturally arises when one attempts to generalize knot theory in order to deal with embeddings and isotopies of “thick” circles and, more generally, “thick” spheres into Euclidean spaces. We introduce the notion of knot “with thick rope” types. The theory of knot “with thick rope” types turns out to be quite different from the classical knot theory because of the following result: There exists an infinite set of non-trivial knot “with thick rope” types in codimension one for every dimension greater than or equal to five.     

ω‐saturated quasi‐minimal models of Th(ℚω, +, σ, 0)

We show that (ℚ^ω, +, σ, 0) is a quasi-minimal torsion-free divisible abelian group. After discussing the axiomatization of the theory of this structure, we present its ω-saturated quasi-minimal model. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

W2, p estimates of the heat equation in Ω⊂ℝn and the restrictions on ∂Ω

This is an alternative approach of finding the W^{2, p} estimates of the heat equation in a domain, Ω??ⁿ. Methods used in (Acta Math. Sin. 2003; 19 (2):381–396) are expanded to the case of a bounded domain. As a result, milder restrictions are applied to ?Ω than previously required by using the classical singular integral approach. Copyright © 2005 John Wiley & Sons, Ltd.     

Sufficient conditions for graphs to be λ′‐optimal,super‐edge‐connected,and maximally edge‐connected

The restricted‐edge‐connectivity of a graph G, denoted by λ′(G), is defined as the minimum cardinality over all edge‐cuts S of G, where G‐S contains no isolated vertices. The graph G is called λ′‐optimal, if λ′(G) = ξ(G), where ξ(G) is the minimum edge‐degree in G. A graph is super‐edge‐connected, if every minimum edge‐cut consists of edges adjacent to a vertex of minimum degree. In this paper, we present sufficient conditions for arbitrary, triangle‐free, and bipartite graphs to be λ′‐optimal, as well as conditions depending on the clique number. These conditions imply super‐edge‐connectivity, if δ (G) ≥ 3, and the equality of edge‐connectivity and minimum degree. Different examples will show that these conditions are best possible and independent of other results in this area. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 228–246, 2005     

The spectrum of BSA(v, 3, λ; α) with α = 2,3

In this article, a kind of auxiliary design BSA^* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA^*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007