Hypergraphs,Quasi-randomness,and Conditions for Regularity

Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung and Graham considered several quite disparate properties of random-like hypergraphs of density 1/2 and proved that they are in fact equivalent. The central concept in their work turned out to be the so called deviation of a hypergraph. They proved that having small deviation is equivalent to a variety of other properties that describe quasi-randomness. In this paper, we consider the concept of discrepancy for k-uniform hypergraphs with an arbitrary constant density d (0<d<1) and prove that the condition of having asymptotically vanishing discrepancy is equivalent to several other quasi-random properties of $\text{H}$, similar to the ones introduced by Chung and Graham. In particular, we prove that the correct “spectrum” of the s-vertex subhypergraphs is equivalent to quasi-randomness for any s⩾2k. Our work may be viewed as a continuation of the work of Chung and Graham, although our proof techniques are different in certain important parts.     

Vagueness, ignorance, and margins for error

We argue that the epistemic theory of vagueness cannot adequately justify its key tenet-that vague predicates have precisely bounded extensions, of which we are necessarily ignorant. Nor can the theory adequately account for our ignorance of the truth values of borderline cases. Furthermore, we argue that Williamson’s promising attempt to explicate our understanding of vague language on the model of a certain sort of “inexact knowledge” is at best incomplete, since certain forms of vagueness do not fit Williamson’s model, and in fact fit an alternative model. Finally, we point out that a certain kind of irremediable inexactitude postulated by physics need not be-and is not commonly-interpreted as epistemic. Thus, there are aspects of contemporary science that do not accord well with the epistemicist outlook.     

Hybrid,numerical solutions,for three-dimensional,compressible Navier-Stokes layer

The author proposes new hybrid solutions for the three-dimensional, compressible Navier-Stokes layer (NSL) over a flying configuration (FC), which use the analytical potential solutions, of the same FC, two times, namely: to reinforce the numerical solutions by multiplying them with these analytical solutions and as outer flow (instead of the parallel flow, used by Prandtl in his boundary layer theory). These hybrid solutions fulfill the last behavior, have correct jumps along the singular lines (like subsonic leading edges, junction lines wing-fuselage, etc.), are split, accurate and rapid convergent. (© 2009 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A bijection for triangulations, quadrangulations, pentagulations, etc.

A d-angulation is a planar map with faces of degree d. We present for each integer d?3 a bijection between the class of d-angulations of girth d (i.e., with no cycle of length less than d) and a class of decorated plane trees. Each of the bijections is obtained by specializing a “master bijection” which extends an earlier construction of the first author. Our construction unifies known bijections by Fusy, Poulalhon and Schaeffer for triangulations (d=3) and by Schaeffer for quadrangulations (d=4). For d?5, both the bijections and the enumerative results are new.We also extend our bijections so as to enumerate p-gonal d-angulations (d-angulations with a simple boundary of length p) of girth d. We thereby recover bijectively the results of Brown for simple p-gonal triangulations and simple 2p-gonal quadrangulations and establish new results for d?5.A key ingredient in our proofs is a class of orientations characterizing d-angulations of girth d. Earlier results by Schnyder and by De Fraysseix and Ossona de Mendez showed that simple triangulations and simple quadrangulations are characterized by the existence of orientations having respectively indegree 3 and 2 at each inner vertex. We extend this characterization by showing that a d-angulation has girth d if and only if the graph obtained by duplicating each edge d−2 times admits an orientation having indegree d at each inner vertex.     

Sturm comparison and separation theorems for linear,second order,self-adjoint,ordinary, differential equations and for first order systems

Sturm comparison and separation theorems, for first order linear combinations of solutions of linear, second order, self-adjoint, ordinary, differential equations, are obtained as consequences of Sturm comparison and separation theorems for linear combinations of components of solutions of linear, first order systems of ordinary, differential equations.     

Existence theorems for regular,closed, convex surfaces

With the help of C. Miranda's method, developed in RZh. Mat. 1972, IA 1121 and 2A 917, existence problems are studied for closed convex surfaces whose principal radii of curvatureR ₁(n) andR ₂(n) satisfy an equation of the form R₁R₂ + (R₁ + R₂, R₁, R₂, n) + cn = (n), where c is a constant vector connected to the desired surface and the closure condition holds for(n). Here, in contrast to C. Miranda's papers, it is not assumed that ₁0. Instead, it is required that the first partial derivatives of with respect toR ₁ andR ₂ be nonnegative. A special case of the proved general theorem is the theorem about the existence of an equation in which is equal to the reciprocal of the mean curvature of the surface. The question of carrying over certain of Miranda's results to the case where increases as (R₁R₂)^µ, where µ>1, is also considered.Translated from Ukrainskii Geometricheskii Sbornik, No. 34, pp. 69–80, 1991.     

Invariance results for linear,time-invariant,discrete-time systems

We establish a general invariance result for linear, time-invariant, discrete-time systems. This result, which constitutes necessary and sufficient conditions for asymptotic stability in the large is very general and yields several important variants. The results presented herein are in the same spirit as the authors’ earlier results for linear, time-invariant continuous-time systems. We demonstrate the applicability of the present results by means of a specific example.     

Probing for reasons: Presentations, questions, phases

This paper reports on a research study based on data from experimental teaching. Undergraduate dance majors were invited, through real-world problem tasks that raised central conceptual issues, to invent major ideas of calculus. This study focuses on work and thinking by these students, as they sought to build key ideas, representations and compelling lines of reasoning. Speiser and Walter's psychological and logical perspectives (see Speiser, Walter, & Sullivan, 2007) provide opportunities to focus not just on the students’ thinking, but perhaps most especially, through detailed examination of important choices, on their exercise of agency as learners. Close analysis of student data through these lenses triggered the development of two new analytic categories—logic of agency and logic of proof. The analysis presented here treats students as active shapers of their own experience and understanding, whose choices open opportunities for continued growth and learning, not just for themselves but also for each other.     

A one-round,two-prover,zero-knowledge protocol for NP

The model of zero-knowledge multi-prover interactive proofs was introduced by Ben-Or, Goldwasser, Kilian and Wigderson in [4]. A major open problem associated with this model is whether NP problems can be proven by one-round, two-prover, zero-knowledge protocols with exponentially small error probability (e.g. via parallel executions). A positive answer was claimed by Fortnow, Rompel and Sipser in [12], but its proof was later shown to be flawed by Fortnow who demonstrated that the probability of cheating inn independent parallel rounds can be much higher than the probability of cheating inn independent sequential rounds (with exponential ratio between them). In this paper we solve this problem: We show a new one-round two-prover interactive proof for Graph Hamiltonicity, we prove that it is complete, sound and perfect zeroknowledge, and thus every problem in NP has a one-round two-prover interactive proof which is perfectly zero knowledge under no cryptographic assumptions. The main difficulty is in proving the soundness of our parallel protocol namely, proving that the probability of cheating in this one-round protocol is upper bounded by some exponentially low threshold. We prove that this probability is at most 1/2 ^n/9 (wheren is the number of parallel rounds), by translating the soundness problem into some extremal combinatorial problem, and then solving this new problem.     

Controllability,inertia, and stability for tridiagonal matrices

Criteria are given for the controllability of certain pairs of tridiagonal matrices. These criteria may be used, with the Chen-Wimmer theorem, to obtain inertia results. Also, a characterization is given of those nonsingular tridiagonal matrices with certain principal minors nonnegative which are positive stable. This extends a previous characterization of the real D-stable tridiagonal matrices.     

Fundamental Constructions for Coalgebras, Corings, and Comodules

We study the various categories of corings, coalgebras, and comodules from a categorical perspective. Emphasis is given to the question which properties of these categories can be seen as instances of general categorical resp. algebraic results. However, we also obtain new results concerning the existence of limits and of factorizations of morphisms.      

Classical solvability for one-dimensional, free boundary, Florin, Muskat-Verigin, and Stefan problems

Three one-dimensional problems with free boundary for second order parabolic equations are considered, namely, the Florin, Muskat-Verigin, and Stefan problems. Existence and uniqueness theorems in the weighted Hölder spaces are established for these problems. Coercive estimates for solutions are found. Bibliography:44 titles.     

Phase Shift Modulations for Stable,Oscillatory, Traveling,Strongly Nonlinear Waves

Oscillatory dispersive waves propagating in a slowly varying medium are analyzed for Klein-Gordon equations with perturbations. The method of multiple scales is extended to include two fast scales, the usual traveling-wave phase and time, in order to allow initial conditions not usually permitted. An exact wave-action equation is introduced if the traveling wave is stable, involving averages over the periodic wave as well as time. This is equivalent to an extended averaged Lagrangian principle. The equation for the slow modulations of the phase shift of the traveling wave is derived from the higher order terms in the exact action equation and is shown to be the same as in earlier more restrictive studies.     

One Setting for All: Metric, Topology, Uniformity, Approach Structure

For a complete lattice V which, as a category, is monoidal closed, and for a suitable Set-monad T we consider (T,V)-algebras and introduce (T,V)-proalgebras, in generalization of Lawvere's presentation of metric spaces and Barr's presentation of topological spaces. In this lax-algebraic setting, uniform spaces appear as proalgebras. Since the corresponding categories behave functorially both in T and in V, one establishes a network of functors at the general level which describe the basic connections between the structures mentioned by the title. Categories of (T,V)-algebras and of (T,V)-proalgebras turn out to be topological over Set.