Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.     

Algebraic properties of discrete box splines

The central objective of this paper is to discuss linear independence of translates of discrete box splines which we introduced earlier as a device for the fast computation of multivariate splines. The results obtained here allow us to draw conclusions about the structure of such discrete splines which have, in particular, applications to counting the number of nonnegative integer solutions of linear diophantine equations.     

A Problem-Solving Based Mathematics Course and Elementary Teachers' Beliefs

This study examined the impact a problem-solving based mathematics content course for preservice elementary education teachers (PSTs) had on challenging the beliefs they held with respect to mathematics and themselves as doers of mathematics. Nine PSTs were interviewed to gain insight into changes that occurred to their belief systems and what aspect(s) of the course were instrumental in producing those changes. Surveys to measure how strongly PSTs subscribed to five mathematical beliefs were administered to 137 PSTs who were enrolled in the course. Significant positive changes (p < .01) were observed for four of the five beliefs. When changes were studied by achievement level, students with final grades of A or B showed statistically significant changes (p < .005) in three of the five beliefs. Students who were interviewed consistently reported increased confidence in their mathematical abilities as a result of the course.     

Half-explicit Runge-Kutta methods for semi-explicit differential-algebraic equations of index 1

Summary For the numerical solution of non-stiff semi-explicit differentialalgebraic equations (DAEs) of index 1 half-explicit Runge-Kutta methods (HERK) are considered that combine an explicit Runge-Kutta method for the differential part with a simplified Newton method for the (approximate) solution of the algebraic part of the DAE. Two principles for the choice of the initial guesses and the number of Newton steps at each stage are given that allow to construct HERK of the same order as the underlying explicit Runge-Kutta method. Numerical tests illustrate the efficiency of these methods.     

Multiple ergodic theorems

Given measure preserving transformationsT ₁,T ₂,...,T _s of a probability space (X,B, μ) we are interested in the asymptotic behaviour of ergodic averages of the form $$\frac{1}{N}\sum\limits_{n = 0}^{N - 1} {T_1^n f_1 \cdot T_2^n f_2 } \cdot \cdots \cdot T_s^n f_s $$ wheref ₁,f ₂,...,f _s ?L ^∞(X,B,μ). In the general case we study, mainly for commuting transformations, conditions under which the limit of (1) inL ²-norm is ∫ _x f ₁ dμ·∫ _x f ₂ dμ...∫ _x f _s dμ for anyf ₁,f ₂...,f _s ?L ^∞(X,B,μ). If the transformations are commuting epimorphisms of a compact abelian group, then this limit exists almost everywhere. A few results are also obtained for some classes of non-commuting epimorphisms of compact abelian groups, and for commuting epimorphisms of arbitrary compact groups.     

Algorithmic aspects of intersection graphs and representation hypergraphs

Let be a family of sets. The intersection graph of is obtained by representing each set in by a vertex and connecting two vertices by an edge if and only if their corresponding sets intersect. Of primary interest are those classes of intersection graphs of families of sets having some specific topological or other structure. The grandfather of all intersection graphs is the class of interval graphs, that is, the intersection graphs of intervals on a line.The scope of research that has been going on in this general area extends from the mathematical and algorithmic properties of intersection graphs, to their generalizations and graph parameters motivated by them. In addition, many real-world applications involve the solution of problems on such graphs.In this paper a number of topics in algorithmic combinatorics which involve intersection graphs and their representative families of sets are presented. Recent applications to computer science are also discussed. The intention of this presentation is to provide an understanding of the main research directions which have been investigated and to suggest possible new directions of research.     

Correlation length bounds for disordered Ising ferromagnets

Thed-dimensional, nearest-neighbor disordered Ising ferromagnet: $$H = - \sum {J_{ij} \sigma _i \sigma _j }$$ is studied as a function of both temperature,T, and a disorder parameter,λ, which measures the size of fluctuations of couplingsJ _ij ≧0. A finite-size scaling correlation length,ζ _f (T, λ), is defined in terms of the magnetic response of finite samples. This correlation length is shown to be equivalent, in the scaling sense, to the quenched average correlation lengthζ(T, λ), defined as the asymptotic decay rate of the quenched average two-point function. Furthermore, the magnetic response criterion which definesζ _f is shown to have a scale-invariant property at the critical point. The above results enable us to prove that the quenched correlation length satisfies: $$C\left| {\log \xi (T)} \right|\xi (T) \geqq \left| {T - T_c } \right|^{ - {2 \mathord{\left/ {\vphantom {2 d}} \right. \kern-\nulldelimiterspace} d}}$$ which implies the boundv≧2/d for the quenched correlation length exponent.