Brooks’ Theorem via the Alon-Tarsi Theorem

We give a proof of Brooks’ Theorem and its choosability extension based on the Alon-Tarsi Theorem; this also shows that Brooks’ Theorem remains valid in a more general game coloring setting.     

Landau’s theorem for polyharmonic mappings

In this paper, we first investigate coefficient estimates for bounded polyharmonic mappings in the unit disk D$\mathbb{D}$. Then, we obtain two versions of Landau’s theorem for polyharmonic mappings F$F$, and for the mappings of the type L(F)$L\left(F\right)$, where L$L$ is the differential operator of Abdulhadi, Abu Muhanna and Khuri. Examples and numerical estimates are given.     

A combinatorial proof of the Dense Hindman’s Theorem

The Dense Hindman’s Theorem states that, in any finite coloring of the natural numbers, one may find a single color and a “dense” set B₁, for each b₁∈B₁ a “dense” set (depending on b₁), for each a “dense” set (depending on b₁,b₂), and so on, such that for any such sequence of b_i, all finite sums belong to the chosen color. (Here density is often taken to be “piecewise syndetic”, but the proof is unchanged for any notion of density satisfying certain properties.) This theorem is an example of a combinatorial statement for which the only known proof requires the use of ultrafilters or a similar infinitary formalism. Here we give a direct combinatorial proof of the theorem.     

A generalization of Sperner’s theorem and an application to graph orientations

A generalization of Sperner’s theorem is established: For a multifamily M={Y₁,…,Y_p} of subsets of {1,…,n} in which the repetition of subsets is allowed, a sharp lower bound for the number φ(M) of ordered pairs (i,j) satisfying i≠j and Y_i⊆Y_j is determined. As an application, the minimum average distance of orientations of complete bipartite graphs is determined.     

A short and constructive proof of Tarski’s fixed-point theorem

I give short and constructive proofs of Tarski’s fixed-point theorem, and of Zhou’s extension of Tarski’s fixed-point theorem to set-valued maps.I thank Charles Blair, William Thomson, an associated editor and a referee for their helpful suggestions.I have taught Tarski’s Theorem with F continuous to Caltech undergraduates.     

A constructive proof of Ky Fan’s coincidence theorem

We present a constructive proof for the well-known Ky Fan’s coincidence theorem through a simplicial algorithm. In a finite number of steps the algorithm generates a simplex containing an approximate coincidence point. In the limit, when the mesh size converges to zero, the sequence of approximations converges to a coincidence point. This research was carried out while the second author was visiting the CentER for Economic Research, Tilburg University. He would like to thank both CentER and the Netherlands Organization for Scientific Research (NWO) for their financial support.     

A proof for Antczak’s mean value theorem in invexity analysis

This paper provides another proof for Antczak’s mean value theorem in invexity analysis.     

Fractional Noether’s theorem in the Riesz-Caputo sense

We prove a Noether’s theorem for fractional variational problems with Riesz-Caputo derivatives. Both Lagrangian and Hamiltonian formulations are obtained. Illustrative examples in the fractional context of the calculus of variations and optimal control are given.     

A handy proof of Gay's theorem

In 1979, Gay proved that Broyden's methods, when used for n‐square linear systems, terminate in at most 2n iterations (SIAM J. Numer. Anal. 1979; 16 :623–630). Also, the ABS methods were introduced in 1984 (Numer. Math. 1984; 45 :1361–1376). In this paper we show another (handy) proof of Gay's theorem by these algorithms. Copyright © 2008 John Wiley & Sons, Ltd.     

A robust Kantorovich’s theorem on the inexact Newton method with relative residual error tolerance

We prove that under semi-local assumptions, the inexact Newton method with a fixed   relative residual error tolerance converges Q$Q$-linearly to a zero of the nonlinear operator under consideration. Using this result we show that the Newton method for minimizing a self-concordant function or to find a zero of an analytic function can be implemented with a fixed relative residual error tolerance.     

On Kersting's proof of the central limit theorem

By an adaptation of a method originally invented by G. Kersting [1] for the calculation of the limiting distribution of Markovian processes the central limit theorem (CLT) is proven. Only the case of equal variances is considered.     

A general Isserlis theorem for mixed-Gaussian random variables

This work generalizes a widely used result derived by L. Isserlis for the expectations of products of jointly Gaussian random variables by extending it to include mixed-Gaussian random variables.     

Application of Rouche’s theorem for MP filter design

The method for the minimum-phase (MP) finite impulse response (FIR) filter design, based on Rouche’s theorem from complex analysis is presented here. The filter is designed directly from a given specification. The method uses the cosine filters and the sharpening technique resulting in a multiplierless filter.     

A simple proof of Sanov’s theorem*

A simple self-contained proof of Sanov's theorem in τ-topology is given, well suited for a first course on large deviations. *This work was supported by the Hungarian National Foundation for Scientific Research under Grant T046376     

A combinatorial proof of Marstrand’s theorem for products of regular Cantor sets

In a paper from 1954 Marstrand proved that if K⊂R² has a Hausdorff dimension greater than 1, then its one-dimensional projection has a positive Lebesgue measure for almost all directions. In this article, we give a combinatorial proof of this theorem when K is the product of regular Cantor sets of class C^1+α, α>0, for which the sum of their Hausdorff dimension is greater than 1.     

A constructive proof of the Peter‐Weyl theorem

We present a new and constructive proof of the Peter‐Weyl theorem on the representations of compact groups. We use the Gelfand representation theorem for commutative C*‐algebras to give a proof which may be seen as a direct generalization of Burnside's algorithm [3]. This algorithm computes the characters of a finite group. We use this proof as a basis for a constructive proof in the style of Bishop. In fact, the present theory of compact groups may be seen as a natural continuation in the line of Bishop's work on locally compact, but Abelian, groups [2]. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A Note on the Browder＇s and Weyl＇s Theorem

Let T be a Banach space operator, E（T） be the set of all isolated eigenvalues of T and π（T） be the set of all poles of T. In this work, we show that Browder＇s theorem for T is equivalent to the localized single-valued extension property at all complex numbers λ in the complement of the Weyl spectrum of T, and we give some characterization of Weyl＇s theorem for operator satisfying E（T） = π（T）. An application is also given.     

A simple proof of an inequality connecting the alternating number of independent sets and the decycling number

If s_k denotes the number of independent sets of cardinality k and α(G) is the size of a maximum independent set in graph G, then I(G;x)=s₀+s₁x+?+s_α(G)x^α(G) is the independence polynomial of G (Gutman and Harary, 1983) [8].In this paper we provide an elementary proof of the inequality|I(G;−1)|≤2^φ(G) (Engström, 2009) [7], where φ(G) is the decycling number of G (Beineke and Vandell, 1997) [3], namely, the minimum number of vertices that have to be deleted in order to turn G into a forest.     

The computational content of Walras’ existence theorem

In [Y. Tanaka, Undecidability of the Uzawa equivalence theorem and LLPO, Appl. Math. Comput. 201 (2008) 378-383] Yasuhito Tanaka showed that Walras’ existence theorem implies the nonconstructive lesser limited principle of omniscience (LLPO); it follows that Walras’ existence theorem does not admit a constructive proof. We give a constructive proof of an approximate version of Walras’ existence theorem from which the full theorem can be recovered with an application of LLPO. We then push Uzawa’s equivalence theorem to the level of approximate solutions, before considering economies with at most one equilibrium.     

The edge version of Hadwiger’s conjecture

A well known conjecture of Hadwiger asserts that K_n+1 is the only minor minimal graph of chromatic number greater than n. In this paper, all minor minimal graphs of chromatic index greater than n are determined.