We consider maximum likelihood estimation of finite mixture of uniform distributions. We prove that maximum likelihood estimator is strongly consistent, if the scale parameters of the component uniform distributions are restricted from below by exp(−nd), 0 < d < 1, where n is the sample size.

In this paper, we prove that the Strong Novikov Conjecture for a residually finite group is essentially equivalent to the Coarse Geometric Novikov Conjecture for a certain metric space associated to the group. As an application, we obtain the Coarse Geometric Novikov Conjecture for a large class of sequences of expanders.

We construct several geometric representatives for the C/Zm fractional branes on either a partially or the completely resolved orbifold. In the process we use large radius and conifold-type monodromies, and provide a strong consistency check. In particular, for C/Z5 we give three different sets of geometric representatives. We also find the explicit Seiberg-duality, in the Berenstein-Douglas se...

The concepts of (∈γ ,∈γ ∨ qδ)-fuzzy h-ideals and (∈γ ,∈γ ∨ qδ)-fuzzy hinterior ideals in hemirings are introduced. Some new characterization theorems of these kinds of fuzzy h-ideals are also given. In particular, we investigate prime and strong prime (∈γ ,∈γ ∨ qδ)-fuzzy h-ideals in hemirings. Finally, we show that the h-hemiregular and h-semisimple hemirings can be described by using these kin...

Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent with u2 and v1 is adjacent with v2). In this paper, we first collect the earlier results about strong product and then we present applications of ...

It is known that every multigraph with an even number of edges has an even orientation (i.e., all indegrees are even). We study parity constrained graph orientations under additional constraints. We consider two types of constraints for a multigraph G = (V,E): (1) an exact conflict constraint is an edge set C ⊆ E and a vertex v ∈ V such that C should not equal the set of incoming edges at v; (2...

We study Lascar strong types and Galois types and especially their relation to notions of type which have finite character. We define a notion of a strong type with finite character, so called Lascar type. We show that this notion is stronger than Galois type over countable sets in simple and superstable finitary AECs. Furthermore we give and example where the Galois type itself does not have f...