The regularity of stress patterns in a language depends on distributional stress regularity, which arises from the pattern of stressed and unstressed syllables, and durational stress regularity, which arises from the timing of syllables. Here we focus on distributional regularity, which depends on three factors. Lexical stress patterning refers to normal stress patterns within words; interlexic...

This paper studies an incompressible non-Newtonian fluid with delays in two-dimensional bounded domains. We first prove the existence and uniqueness of solutions. Then we establish the existence of pullback attractors {AC H (t)}t∈R (has L-regularity), {AC W (t)}t∈R (has H-regularity), and {AE2 H (t)}t∈R (has L-regularity), {A E2 W (t)}t∈R (has H-regularity) corresponding to two different proces...

We give two new characterizations of the notion Lyapunov regularity in terms lower and upper exponential growth rates singular values. These motivate introduction coefficients. In particular, we establish relations between these coefficients coefficient. Moreover, construct explicitly bounded sequences matrices attaining specific values

In this work we study the wavefront set of a solution u to Pu = f , where P is a pseudodifferential operator on a manifold with real-valued homogeneous principal symbol p, when the Hamilton vector field corresponding to p is radial on a Lagrangian submanifold Λ contained in the characteristic set of P . The standard propagation of singularities theorem of Duistermaat-Hörmander gives no informat...

The main goal of the paper is to generalize Castelnuovo-Mumford regularity for coherent sheaves on projective spaces to coherent sheaves on n-dimensional smooth projective varieties X with an n-block collection B which generates the bounded derived category Db(OX -mod). To this end, we use the theory of n-blocks and Beilinson type spectral sequence to define the notion of regularity of a cohere...

Thomason and Chung, Graham and Wilson were the first to systematically study quasirandom graphs and hypergraphs and showed that several properties of random graphs imply each other in a deterministic sense. In particular, they showed that ε-regularity from Szemerédi’s regularity lemma is equivalent to their concepts. Over recent years several hypergraph regularity lemmas were established. In th...

In this paper we introduce a new clustering technique called Regularity Clustering. This new technique is based on the practical variants of the two constructive versions of the Regularity Lemma, a very useful tool in graph theory. The lemma claims that every graph can be partitioned into pseudo-random graphs. While the Regularity Lemma has become very important in proving theoretical results, ...

Distance-regular graphs have been a key concept in Algebraic Combinatorics and have given place to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we study ‘almost distance-regular graphs’. We use this name informally for graphs that share some regularity properties that are related to distance in the ...