Conforming finite element methods for the von Kármán equations

In this paper, we consider canonical von Kármán equations that describe the bending of thin elastic plates defined on polygonal domains. A conforming finite element method is employed to approximate the displacement and Airy stress functions. Optimal order error estimates in energy, H ¹ and L ² norms are deduced. The results of numerical experiments confirm the theoretical results obtained.     

On the compatibility relation for the Föppl–von Kármán plate equations

By using a coordinate-free approach we propose a new derivation of the compatibility equation for the Föppl–von Kármán nonlinear plate theory.     

Ball polytopes and the Vázsonyi problem

Let V be a finite set of points in the Euclidean d-space (d ≧ 2). The intersection of all unit balls B(υ, 1) centered at υ, where υ ranges over V, henceforth denoted by $ \mathcal{B} $ (V) is the ball polytope associated with V. After some preparatory discussion on spherical convexity and spindle convexity, the paper focuses on two central themes. (a) Define the boundary complex of $ \mathcal{B} $ (V), i.e., define its vertices, edges and facets in dimension 3, and investigate its basic properties. (b) Apply results of this investigation to characterize finite sets of diameter 1 in the (Euclidean) 3-space for which the diameter is attained a maximal number of times as a segment (of length 1) with both endpoints in V. A basic result for such a characterization goes back to Grünbaum, Heppes and Straszewicz, who proved independently of each other, in the late 1950’s by means of ball polytopes, that the diameter of V is attained at most 2|V| ? 2 times. Call V extremal if its diameter is attained this maximal number (2|V| ? 2) of times. We extend the aforementioned result by showing that V is extremal iff V coincides with the set of vertices of its ball polytope $ \mathcal{B} $ (V) and show that in this case the boundary complex of $ \mathcal{B} $ (V) is self-dual in some strong sense. The problem of constructing new types of extremal configurations is not addressed in this paper, but we do present here some such new types.     

Optimizing over the first Chvátal closure

How difficult is, in practice, to optimize exactly over the first Chvátal closure of a generic ILP? Which fraction of the integrality gap can be closed this way, e.g., for some hard problems in the MIPLIB library? Can the first-closure optimization be useful as a research (off-line) tool to guess the structure of some relevant classes of inequalities, when a specific combinatorial problem is addressed? In this paper we give answers to the above questions, based on an extensive computational analysis. Our approach is to model the rank-1 Chvátal-Gomory separation problem, which is known to be NP-hard, through a MIP model, which is then solved through a general-purpose MIP solver. As far as we know, this approach was never implemented and evaluated computationally by previous authors, though it gives a very useful separation tool for general ILP problems. We report the optimal value over the first Chvátal closure for a set of ILP problems from MIPLIB 3.0 and 2003. We also report, for the first time, the optimal solution of a very hard instance from MIPLIB 2003, namely nsrand-ipx, obtained by using our cut separation procedure to preprocess the original ILP model. Finally, we describe a new class of ATSP facets found with the help of our separation procedure.     

Strengthening the Lovász bound for graph coloring

The Lovász -number is a way to approximate the independence number of a graph, but also its chromatic number. We express the Lovász bound as the continuous relaxation of a discrete Lovász -number which we derive from Karger et al.s formulation, and which is equal to the chromatic number. We also give another relaxation à la Schrijver-McEliece, which is better than the Lovász -number.     

On the Generalized Szász–Mirakyan Operators

In this paper, we construct sequences of Szász–Mirakyan operators which are based on a function ρ. This function not only characterizes the operators but also characterizes the Korovkin set ${\left \{ 1,\rho ,\rho ^{2} \right \}}$ in a weighted function space. We give theorems about convergence of these operators to the identity operator on weighted spaces which are constructed using the function ρ and which are subspaces of the space of continuous functions on ${\mathbb{R} ^{+}}$ . We give quantitative type theorems in order to obtain the degree of weighted convergence with the help of a weighted modulus of continuity constructed using the function ρ. Further, we prove some shape-preserving properties of the operators such as the ρ-convexity and the monotonicity. Our results generalize the corresponding ones for the classical Szász operators.     

The necessary and sufficient condition for bifurcation in the von Kármán equations

The paper is devoted to the study of bifurcation in the von Kármán equations with two parameters that describe the behaviour of a thin round elastic plate lying on an elastic base under the action of a compressing force. The problem appears in the mechanics of elastic constructions. We prove the necessary and sufficient condition for bifurcation at points of the set of trivial solutions. Our proof is based on reducing the von Kármán equations to an operator equation in Banach spaces with a nonlinear Fredholm map of index 0 and applying the Crandall-Rabinowitz theorem on simple bifurcation points or a finite-dimensional reduction and degree theory. RID="h1" ID="h1"This research was supported by grant BW of UG no. 5100-5-0153-1 and by grant KBN no. 5 P03A 020 20.     

Application of Topological Degree to the Study of Bifurcation in von Kármán Equations

The aim of this paper is to illustrate the use of topological degree for the study of bifurcation in von Kármán equations with two real positive parameters and for a thin elastic disk lying on the elastic base under the action of a compressing force, which may be written in the form of an operator equation F(x, , ) = 0 in some real Banach spaces X and Y. The bifurcation problem that we study is a mathematical model for a certain physical phenomenon and it is very important in the mechanics of elastic constructions. We reduce the bifurcation problem in the solution set of equation F(x, , ) = 0 at a point (0, ₀, ₀) X × IR ₊ ² to the bifurcation problem in the solution set of a certain equation in IR ⁿ at a point (0, ₀, ₀) IR ⁿ × IR ₊ ², where n = dim Ker F _x (0, ₀, ₀) and F _x (0, ₀, ₀): X Y is a Fréchet derivative of F with respect to x at (0, ₀, ₀). To solve the bifurcation problem obtained as a result of reduction, we apply homotopy and degree theory.     

A mixed variational principle for the Föppl–von Kármán equations

A mixed variational principle is proposed for deducing the Föppl–von Kármán equations governing the large deflections of thin elastic plates or shallow shells. Proper boundary conditions are found for the case of applied in-plane tractions and displacements, and simple mechanical interpretations are achieved. Numerical implementation is carried out, along with examples and comparisons with the classical formulation in terms of displacements.     

A lower bound on the Chvátal-rank of Antiwebs

In [Holm, E., L. M. Torres and A. K. Wagler, On the Chvátal-rank of linear relaxations of the stable set polytope, International Transactions in Operational Research 17 (2010), pp. 827–849; Holm, E., L. M. Torres and A. K. Wagler, On the Chvátal-rank of Antiwebs, Electronic Notes in Discrete Mathematics 36 (2010), pp. 183–190] we study the Chvátal-rank of the edge constraint and the clique constraint stable set polytopes related to antiwebs. We present schemes for obtaining both upper and lower bounds. Moreover, we provide an algorithm to compute the exact values of the Chvátal-rank for all antiwebs with up to 5,000 nodes. Here we prove a lower bound as a closed formula and discuss some cases when this bound is tight.     

On the Ramsey-Turán numbers of graphs and hypergraphs

Let t be an integer, f(n) a function, and H a graph. Define the t-Ramsey-Turán number of H, RT _t (n,H, f(n)), to be the maximum number of edges in an n-vertex, H-free graph G with α _t (G) ≤ f(n), where α _t (G) is the maximum number of vertices in a K _t -free induced subgraph of G. Erd?s, Hajnal, Simonovits, Sós and Szemerédi [6] posed several open questions about RT _t (n,K _s , o(n)), among them finding the minimum ? such that RT _t (n,K _t+? , o(n)) = Ω(n ²), where it is easy to see that RT _t (n,K _t+1, o(n)) = o(n ²). In this paper, we answer this question by proving that RT _t (n,K _t+2, o(n)) = Ω(n ²); our constructions also imply several results on the Ramsey-Turán numbers of hypergraphs.     

An exact Turán result for the generalized triangle

Let Σ _k consist of all k-graphs with three edges D ₁, D ₂, D ₃ such that |D ₁ ∩ D ₂| = k − 1 and D ₁ Δ D ₂ ⊆ D ₃. The exact value of the Turán function ex(n, Σ _k ) was computed for k = 3 by Bollobás [Discrete Math. 8 (1974), 21–24] and for k = 4 by Sidorenko [Math Notes 41 (1987), 247–259]. Let the k-graph T _k ∈ Σ _k have edges

Convergence of the q Analogue of Szász-Beta-Stancu Operators

In the present paper, we propose the q analogue of Sz a′sz-Beta-Stancu operators. By estimate the moments, we establish direct results in terms of the modulus of smoothness. Investigate the rate of point-wise convergence and weighted approximation properties of the q operators. Voronovskaja type theorem is also obtained.Our results generalize and supplement some convergence results of the q-Sz a′sz-Beta operators, thus they improve the existing results.     

On the Lovász theta function and some variants

The Lovász theta function of a graph is a well-known upper bound on the stability number. It can be computed efficiently by solving a semidefinite program (SDP). Actually, one can solve either of two SDPs, one due to Lovász and the other to Grötschel et al. The former SDP is often thought to be preferable computationally, since it has fewer variables and constraints. We derive some new results on these two equivalent SDPs. The surprising result is that, if we weaken the SDPs by aggregating constraints, or strengthen them by adding cutting planes, the equivalence breaks down. In particular, the Grötschel et al. scheme typically yields a stronger bound than the Lovász one.     

The Turán-type inequality in the space L0 on the unit interval

Analysis Mathematica - Let P(x) be an arbitrary algebraic polynomial of degree n with all zeros in the unit interval ?1 ≤ x ≤ 1. We establish the Turán-type inequality...     

Galois lines for the Giulietti–Korchmáros curve

We describe the arrangement of all Galois lines for the Giulietti–Korchmáros curve in the projective 3-space. As an application, we determine the set of all Galois points for a plane model of the GK curve. This curve possesses many Galois points.