Eigenvalues and colorings of digraphs

Wilf’s eigenvalue upper bound on the chromatic number is extended to the setting of digraphs. The proof uses a generalization of Brooks’ Theorem to digraph colorings.     

On the Grothendieck construction for ∞-categories

We provide, among other things: (i) a Bousfield–Kan formula for colimits in ∞-categories (generalizing the 1-categorical formula for a colimit as a coequalizer of maps between coproducts); (ii) ∞-categorical generalizations of Barwick–Kan's Theorem B_n and Dwyer–Kan–Smith's Theorem C_n (regarding homotopy pullbacks in the Thomason model structure, which themselves vastly generalize Quillen's Theorem B); and (iii) an articulation of the simultaneous and interwoven functoriality of colimits (or dually, of limits) for natural transformations and for pullback along maps of diagram ∞-categories.     

The quasiderivative method for derivative estimates of solutions to degenerate elliptic equations

We give an example of quasiderivatives constructed by random time change, Girsanov’s Theorem and Levy’s Theorem. As an application, we investigate the smoothness and estimate the derivatives up to second order for the probabilistic solution to the Dirichlet problem for the linear degenerate elliptic partial differential equation of second order, under the assumption of non-degeneracy with respect to the normal to the boundary and an interior condition to control the moments of quasiderivatives, which is weaker than non-degeneracy.     

Some remarks on Arslan’s 2011 paper

It is shown that the main theorem of Arslan’s paper (Theorem 2, 2011), as stated, is incorrect. Under additional conditions, we present a short proof of the corrected version of the theorem. We also give a proof of a theorem of Rao and Shanbhag (1991) [2], employed by Arslan, without the use of the Kolmogorov Consistency Theorem.     

Nerves of bicategories as stratified simplicial sets

In this paper, we aim to move towards a definition of weak n-category akin to Street’s definition of weak ω-category. This will be accomplished in dimension 1 directly and in dimension 2 by comparison with work of Duskin. In particular, we discuss the relationship between certain weak complicial sets and Duskin’s n-dimensional Postnikov complexes.     

Sliding puzzles and rotating puzzles on graphs

Sliding puzzles on graphs are generalizations of the Fifteen Puzzle. Wilson has shown that the sliding puzzle on a 2-connected graph always generates all even permutations of the tiles on the vertices of the graph, unless the graph is isomorphic to a cycle or the graph θ₀ [R.M. Wilson, Graph puzzles, homotopy, and the alternating group, J. Combin. Theory Ser. B 16 (1974) 86–96]. In a rotating puzzle on a graph, tiles are allowed to be rotated on some of the cycles of the graph. It was shown by Scherphuis that all even permutations of the tiles are also obtainable for the rotating puzzle on a 2-edge-connected graph, except for a few cases. In this paper, Scherphuis’ Theorem is generalized to every connected graph, and Wilson’s Theorem is derived from the generalized Scherphuis’ Theorem, which will give a uniform treatise for these two families of puzzles and reveal the structural relation of the graphs of the two puzzles.     

The great theorem of A.A. Markoff and Jean Bernoulli sequences

A proof of Markoff’s Great Theorem on the Lagrange spectrum using continued fractions is sketched. Markoff’s periods and Jean Bernoulli sequence ¹ are used to obtain a simple algorithm for the computation of the Lagrange spectrum below 3.     

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.     

Semistrict models of connected 3-types and Tamsamani’s weak 3-groupoids

Homotopy 3-types can be modelled algebraically by Tamsamani’s weak 3-groupoids as well as, in the path-connected case, by cat²-groups. This paper gives a comparison between the two models in the path-connected case. This leads to two different semistrict algebraic models of connected 3-types using Tamsamani’s model. Both are then related to Gray groupoids.     

Generic hyperbolicity of stationary solutions for a reaction-diffusion system

In this paper, we study the generic hyperbolicity of equilibria of a reaction-diffusion system with respect to nonlinear terms in the set of C²-functions equipped with the Whitney Topology. To accomplish this, we combine Baire’s Lemma and the usual Transversality Theorem.     

Existence of nontrivial homoclinic orbits for fourth-order difference equations

We obtain a sufficient condition for the existence of nontrivial homoclinic orbits for fourth-order difference equations by using Mountain Pass Theorem, a weak convergence argument and a discrete version of Lieb’s lemma.     

Natural density of rectangular unimodular integer matrices

In this paper, we compute the natural density of the set of k×n integer matrices that can be extended to an invertible n×n matrix over the integers. As a corollary, we find the density of rectangular matrices with Hermite normal form . Connections with Cesàro’s Theorem on the density of coprime integers and Quillen-Suslin’s Theorem are also presented.     

An extension of Willard’s Finite Basis Theorem: Congruence meet-semidistributive varieties of finite critical depth

Ross Willard proved that every congruence meet-semidistributive variety of algebras that has a finite residual bound and a finite signature can be axiomatized by some finite set of equations. We offer here a simplification of Willards proof, avoiding its use of Ramseys Theorem. This simplification also extends Willards theorem by replacing the finite residual bound with a weaker condition.In Celebration of the Sixtieth Birthday of Ralph N. McKenzieReceived February 26, 2004; accepted in final form August 2, 2004.     

Multivariate process capability via Löwner ordering

Probability bounds can be derived for distributions whose covariance matrices are ordered with respect to Löwner partial ordering, a relation that is based on whether the difference between two matrices is positive definite. One example is Anderson’s Theorem. This paper develops a probability bound that follows from Anderson’s Theorem that is useful in the assessment of multivariate process capability. A statistical hypothesis test is also derived that allows one to test the null hypothesis that a given process is capable versus the alternative hypothesis that it is not capable on the basis of a sample of observed quality characteristic vectors from the process. It is argued that the proposed methodology is viable outside the multivariate normal model, where the p-value for the test can be computed using the bootstrap. The methods are demonstrated using example data, and the performance of the bootstrap approach is studied empirically using computer simulations.     

Generalized Serre relations for Lie algebras associated with positive unit forms

Every semisimple Lie algebra defines a root system on the dual space of a Cartan subalgebra and a Cartan matrix, which expresses the dual of the Killing form on a root base. Serre’s Theorem [J.-P. Serre, Complex Semisimple Lie Algebras (G.A. Jones, Trans.), Springer-Verlag, New York, 1987] gives then a representation of the given Lie algebra in generators and relations in terms of the Cartan matrix.In this work, we generalize Serre’s Theorem to give an explicit representation in generators and relations for any simply laced semisimple Lie algebra in terms of a positive quasi-Cartan matrix. Such a quasi-Cartan matrix expresses the dual of the Killing form for a Z-base of roots. Here, by a Z-base of roots, we mean a set of linearly independent roots which generate all roots as linear combinations with integral coefficients.     

A polynomial of degree four not satisfying Rolle’s theorem in the unit ball of <Emphasis Type="Italic">l</Emphasis><Subscript>2</Subscript>

We give an example of a fourth degree polynomial which does not satisfy Rolles Theorem in the unit ball of l ₂.The author has been partially supported by MCyT and FEDER Project BFM2002-01423.     

Number of zeros of interval polynomials

In this paper, we develop a rigorous algorithm for counting the real interval zeros of polynomials with perturbed coefficients that lie within a given interval, without computing the roots of any polynomials. The result generalizes Sturm’s Theorem for counting the roots of univariate polynomials to univariate interval polynomials.     

Rational homotopy theory and differential graded category

We propose a generalization of Sullivan’s de Rham homotopy theory to non-simply connected spaces. The formulation is such that the real homotopy type of a manifold should be the closed tensor dg-category of flat bundles on it much the same as the real homotopy type of a simply connected manifold is the de Rham algebra in original Sullivan’s theory. We prove the existence of a model category structure on the category of small closed tensor dg-categories and as a most simple case, confirm an equivalence between the homotopy category of spaces whose fundamental groups are finite and whose higher homotopy groups are finite dimensional rational vector spaces and the homotopy category of small closed tensor dg-categories satisfying certain conditions.