A. The regularity lemma for 3-uniform hypergraphs asserts that every large hypergraph can be decomposed into a bounded number of quasi-random structures consisting of a sub-hypergraph and a sparse underlying graph. In this paper we show that in such a quasirandom structure most pairs of the edges of the graph can be connected by hyperpaths of length at most twelve. Some applications are ...

in this paper, the concept of k-regular fuzzy matrix as a general- ization of regular matrix is introduced and some basic properties of a k-regular fuzzy matrix are derived. this leads to the characterization of a matrix for which the regularity index and the index are identical. further the relation between regular, k-regular and regularity of powers of fuzzy matrices are dis- cussed.

We present a new AFEM for the Laplace-Beltrami operator with arbitrary polynomial degree on parametric surfaces, which are globally W 1 ∞ and piecewise in a suitable Besov class embedded in C1,α with α ∈ (0, 1]. The idea is to have the surface sufficiently well resolved in W 1 ∞ relative to the current resolution of the PDE in H1. This gives rise to a conditional contraction property of the PDE...

Szemerédi’s regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemerédi’s regularity lemma in the context of abelian groups and use it to derive some results in additive number theory. The simplest is a structure theorm for sets which are almost sum-free. If A ⊆ {1, . . . , N} has δN2 triples (a1, a2, a3)...

In this paper we analyze the practical implications of Szemerédi’s regularity lemma in the preservation of metric information contained in large graphs. To this end, we present a heuristic algorithm to find regular partitions. Our experiments show that this method is quite robust to the natural sparsification of proximity graphs. In addition, this robustness can be enforced by graph densification.

The regularity lemma of Szemerédi gives a concise approximate description of a graph via a so called regular partition of its vertex set. In this paper we address the following problem: can a graph have two “distinct” regular partitions? It turns out that (as observed by several researchers) for the standard notion of a regular partition, one can construct a graph that has very distinct regular...

We study the general partitioning problem and the discrepancy problem in dense hypergraphs. Using the regularity lemma [16] and its algorithmic version proved in [5], we give polynomial time approximation schemes for the general partitioning problem and for the discrepancy problem.