Maximal arcs in designs

An (α,n)-arc in a 2-design is a set ofn points of the design such that any block intersects it in at most α points. For such an arc,n is bounded by 1+(r(α−1)/λ), with equality if and only if every block meets the arc in either 0 or α points. An (α,n) arc with equality in above is said to be maximal. A maximal block arc can be dually defined. This generalizes the notion of an oval (α=2) in a symmetric design due to Asmus and van Lint. The aim of this paper is to study the infinite family of possibly extendable symmetric designs other than the Hadamard design family and their related designs using maximal arcs. It is shown that the extendability corresponds to the existence of a proper family of maximal arcs. A natural duality between point and block arcs is established, which among other things implies a result of Cameron and van Lint that extendability of a given design in this family is equivalent to extendability of its dual. Similar results are proved for other related designs.     

Existence and Extendability of Solutions of the Equation g(t,x) = 0

We consider the problem of extendability and existence of solutions of the equation g(t, x) = 0 on the maximum interval of their definition.     

Extending MDS Codes

A q-ary (n, k)-MDS code, linear or not, satisfies n ≤ q + k − 1. A code meeting this bound is said to have maximum length. Using purely combinatorial methods we show that an MDS code with n = q + k − 2 can be uniquely extended to a maximum length code if and only if q is even. This result is best possible in the sense that there is, for example, a non-extendable 4-ary (5, 4)-MDS code. It may be that the proof of our result is as interesting as the result itself. We provide a simple necessary and sufficient condition for code extendability. In future work, this condition might be suitably modified to give an extendability condition for arbitrary (shorter) MDS codes.Received December 1, 2003     

A unified theory for homotopy principles for multimaps

In this article, we present a definition of d-essential and d–L-essential maps in completely regular topological spaces and we establish a homotopy property for both d-essential and d–L-essential maps. Also using the notion of extendability, we present new continuation theorems.     

Quasi-Values on Subspaces

Quasi-values are operators satisfying all axioms of the Shapley value with the possible exception of symmetry. We introduce the characterization and extendability problems for quasivalues on linear subspaces of games, provide equivalence theorems for these problems, and show that a quasi-value on a subspaceQ is extendable to the space of all games iff it is extendable toQ+Sp{u} for every gameu.Finally, we characterize restrictable subspaces and solve the characterization problem for those which are also monotone.     

Tight sets,weighted <Emphasis Type="Italic">m</Emphasis>-covers,weighted <Emphasis Type="Italic">m</Emphasis>-ovoids,and minihypers

Minihypers are substructures of projective spaces introduced to study linear codes meeting the Griesmer bound. Recently, many results in finite geometry were obtained by applying characterization results on minihypers (De Beule et al. 16:342–349, 2008; Govaerts and Storme 4:279–286, 2004; Govaerts et al. 28:659–672, 2002). In this paper, using characterization results on certain minihypers, we present new results on tight sets in classical finite polar spaces and weighted m-covers, and on weighted m-ovoids of classical finite generalized quadrangles. The link with minihypers gives us characterization results of i-tight sets in terms of generators and Baer subgeometries contained in the Hermitian and symplectic polar spaces, and in terms of generators for the quadratic polar spaces. We also present extendability results on partial weighted m-ovoids and partial weighted m-covers, having small deficiency, to weighted m-covers and weighted m-ovoids of classical finite generalized quadrangles. As a particular application, we prove in an alternative way the extendability of 53-, 54-, and 55-caps of PG(5,3), contained in a non-singular elliptic quadric Q⁻(5,3), to 56-caps contained in this elliptic quadric Q⁻(5,3).      

Pancyclicity and extendability in strong products

In this paper, we first prove that for any connected graph G with at least two vertices, there is an integer m for which the strong product X⌅G^m has pancyclic ordering from each vertex. After characterizing the graphs G for which GX⌅K₂ is Hamiltonian, we determine a criterion for extendability of cycles. We also prove that if G is a connected, K_1.3-free graph with δ ≥ 2, then GX⌅XK₂ is fully cycle extendable as well as 1-edge Hamiltonian. © 1996 John Wiley & Sons, Inc.     

On Oscillation of Functions with Bounded Spectral Band

In this paper, we consider extremal oscillatory properties of functions with bounded spectrum, i.e., with bounded support (in the sense of distributions) of the Fourier transform. For such functions f, we give criteria of extendability of }f} from the real axis to a function F on the complex plane with derivatives F ^(m) having no real zeros and without enlarging the width of spectrum. In particular, we give examples of functions $f$ from the real Paley–Wiener space such that every function f ^(m), m=0, 1,..., has a finite number of real zeros.     

Goal-oriented r-adaptivity based on the evaluation of the physical and material residual

This contribution is concerned with goal–oriented r-adaptivity based on energy minimization principles for the primal and the dual problem. We obtain a material residual of the primal and of the dual problem, which are indicators for non–optimal finite element meshes. For goal–oriented r-adaptivity we have to optimize the mesh with respect to the dual solution, because the error of a local quantity of interest depends on the error in the corresponding dual solution. We use the material residual of the primal and dual problem in order to obtain a procedure for mesh optimization with respect to a local quantity of interest. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On universal entire functions with zero-free derivatives

We prove in this note a generalization of a theorem due to G. Herzog on zero-free universal entire functions. Specifically, it is shown that, if a nonnegative integer q and a nonconstant entire function φ of subexponential type are given, then there is a residual set in the class of entire functions with zero-free derivatives of orders q and q + 1, such that every member of that set is universal with respect to φ (D), where D is the differentiation operator. This work is supported in part by DGICYT grant PB93-0926.     

On regularization in parameter-free shape optimization

This contribution is concerned with a parameter-free approach to computational shape optimization of mechanically-loaded structures. Thereby the term ’parameter-free’ refers to approaches in shape optimization in which the design variables are not derived from an existing CAD-parametrization of the model geometry but rather from its finite element discretization. One of the major challenges in using this type of approach is the avoidance of oscillating boundaries in the optimal design trials. This difficulty is mainly attributed to a lack of smoothness of the objective sensitivities and the relatively high number of design variables within the parameter-free regime. To compensate for these deficiencies, Azegami introduced the concept of the so-called traction method, in which the actual design update is deduced from the deformation of a fictitious continuum that is loaded in proportion to the negative shape gradient. We investigate a discrete variant of the traction method, in which the design sensitivities are computed with respect to variations of the design nodes for a given finite element mesh rather than on the abstract level by means of the speed method. Moreover, the design update process is accompanied by adaptive mesh refinement based on discrete material residual forces. Therein, we consider radaptive node relocation as well as hadaptive mesh refinement. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Local paraconvexity and local selection theorems

Theorems on the local extendability of selections for non-convex-valued maps of paracompact spaces into Banach spaces, i.e., infinite-dimensional analogs of the finite-dimensional Michael selection theorem are proved. We were able to obtain these results under an appropriate metric control of the local degree of nonconvexity on the valuesF(x), which naturally leads us to introduce the notion of equi-locally paraconvex families of sets. It is shown that all convex subsets of the integral curves of the differential equationy′=f(x,y) with a continuous right-hand sidef and the isometric images of such subsets form an equi-locally paraconvex family of subsets of a Euclidean space. Translated fromMatematicheskie Zametki, Vol. 65, No. 2, pp. 261–269, February, 1999.     

A technique for constructing non‐embeddable quasi‐residual designs

We propose a technique for constructing two infinite families of non‐embeddable quasi‐residual designs as soon as one such design satisfying certain conditions exists. The main tools are generalized Hadamard matrices and balanced generalized weighing matrices. Starting with a specific non‐embeddable quasi‐residual 2‐(27,9,4) design, we construct for every positive integer m a non‐embeddable 2‐(3^m,3^m?1,(3^m?1?1)/2)‐design, and, if r_m=(3^m?1)/2 is a prime power, we construct for every positive integer n a non‐embeddable design. For each design in these families, a symmetric design with the corresponding parameters is known to exist. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 160–172, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.900     

A posteriori error estimators for mixed finite element methods in linear elasticity

Summary. Three a posteriori error estimators for PEERS and BDMS elements in linear elasticity are presented: one residual error estimator and two estimators based on the solution of auxiliary local problems with different boundary conditions. All of them are reliable and efficient with respect to the standard norm and furthermore robust for nearly incompressible materials.Correspondence to: R. Verfürth     

Infinite families of non‐embeddable quasi‐residual Menon designs

A Menon design of order h² is a symmetric (4h²,2h²‐h,h²‐h)‐design. Quasi‐residual and quasi‐derived designs of a Menon design have parameters 2‐(2h² + h,h²,h²‐h) and 2‐(2h²‐h,h²‐h,h²‐h‐1), respectively. In this article, regular Hadamard matrices are used to construct non‐embeddable quasi‐residual and quasi‐derived Menon designs. As applications, we construct the first two new infinite families of non‐embeddable quasi‐residual and quasi‐derived Menon designs. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 53–62, 2009     

One Boundary Version of Morera's Theorem

Let D be a bounded domain in C ⁿ (n>1) with a connected smooth boundary D and let f be a continuous function on D. We consider conditions (generalizing those of the Hartogs–Bochner theorem) for holomorphic extendability of f to D. As a corollary we derive some boundary analog of Morera's theorem claiming that if the integrals of f vanish over the intersection of the boundary of the domain with complex curves in some class then f extends holomorphically to the domain.     

Closure and stable Hamiltonian properties in claw‐free graphs

In the class of k‐connected claw‐free graphs, we study the stability of some Hamiltonian properties under a closure operation introduced by the third author. We prove that (i) the properties of pancyclicity, vertex pancyclicity and cycle extendability are not stable for any k (i.e., for any of these properties there is an infinite family of graphs G_k of arbitrarily high connectivity k such that the closure of G_k has the property while the graph G_k does not); (ii) traceability is a stable property even for k = 1; (iii) homogeneous traceability is not stable for k = 2 (although it is stable for k = 7). The article is concluded with several open questions concerning stability of homogeneous traceability and Hamiltonian connectedness. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 30–41, 2000     

Extensions of group-valued set functions

The problem of common extension ofcharges (finitely additive measures) is generalised to include group-valued functions defined on a system of sets (u-systems). To eachu-systemU an Abelian groupH(U) is attached. Every Abelian group is isomorphic to one of the formH(U). The groupH(U) is an indicator for extendability of charges fromU to the Boolean algebra generated byU. AllG-valued measures extend if and only if Ext(H(U),G)=0, for instance. Supported as van Vleck visiting professor at Wesleyan University, Connecticut in 1993. Partially supported by the Graduierten KollogTheoretische und experimentelle Methoden der reinen Mathematik of Essen University, a project No. G-0294-081.06/93 of the German-Israeli Foundation for Scientific Research & Development and by the German Academic Exchange, DAAD 1994.     

Local bundle theorems in Laguerreplanes

A Laguerreplane is an incidence structure L=(P, BC,I) with P, B and C non-empty disjoint sets and IP×(BC) an incidence relation satisfying the following axioms: (i) every element of P is incident with exactly one element of B; (ii) every residual plane of L with respect to B is an affine plane; (iii) every element of C is incident with at least one element of P. We define two weak local bundle theorems SB1 and SB2 and we determine the influence of these on the residual planes. It turns out that some of the residual planes are dual translation planes. The second bundle theorem seems to be a useful characterization [11] for the Laguerreplane defined in [2].     

Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups

In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Γ is n‐HC‐extendable if it contains a path of length n and if every such path is contained in some Hamilton cycle of Γ. Similarly, Γ is weakly n‐HP‐extendable if it contains a path of length n and if every such path is contained in some Hamilton path of Γ. Moreover, Γ is strongly n‐HP‐extendable if it contains a path of length n and if for every such path P there is a Hamilton path of Γ starting with P. These concepts are then studied for the class of connected Cayley graphs on abelian groups. It is proved that every connected Cayley graph on an abelian group of order at least three is 2‐HC‐extendable and a complete classification of 3‐HC‐extendable connected Cayley graphs of abelian groups is obtained. Moreover, it is proved that every connected Cayley graph on an abelian group of order at least five is weakly 4‐HP‐extendable. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory