To explain the determinants of negative behavior toward deviants (e.g., punishment), this article examines how people evaluate others on the basis of two types of standards: minimal and maximal. Minimal standards focus on an absolute cutoff point for appropriate behavior; accordingly, the evaluation of others varies dichotomously between acceptable or unacceptable. Maximal standards focus on th...

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

This paper addresses the following question: Does competition enhance efficiency in markets with quality uncertainty? Using the mechanism design methodology, we characterize the maximal achievable level of efficiency in such markets, and then use this characterization to analyze how maximal efficiency varies with the degree of market competition. We show that the relationship between them is in...

BACKGROUND Numerous studies were carried out to develop more sophisticated dressings to expedite healing processes and diminish the bacterial burden in burn wounds. This study assessed the healing effect of nettle extract on second degree burns wound in rats in comparison with silver sulfadiazine and vaseline. METHODS Forty rats were randomly assigned to four equal groups. A deep second-degr...

Community structure detection in complex networks attracts considerable attention in recent years. In this paper we propose an algorithm to detect community structures in very large networks. Basing on the local community detection, this algorithm is able to detect global community structures. We found that the local maximal degree nodes locate dispersedly in networks and can be considered as k...

Studying the geometry of a group G leads us to questions about its maximal subgroups and primitive permutation representations (the G-invariant relations and similar structures, the base size, recognition problems, and so on). Taking the point of view that nite projective geometry is the geometry of the groups PGL(n; q), Aschbacher's theorem gives us eight natural families of geometric objects,...

For every pair of nite connected graphs F and H, and every integer k, we construct a universal graph U with the following properties: 1. There is a homomorphism : U ! H, but no homomorphism from F to U . 2. For every graph G with maximal degree no more than k having a homomorphism h : G! H, but no homomorphism from F to G, there is a homomorphism : G! U , such that h = . Particularly, this solv...

Given a d-web of codimension one on a holomorphic n-dimensional manifold M0 (d > n), we assume that, at any point of M0, the d hyperplanes tangent to the local foliations at a point of M0 are distinct, and that there exists n of them in general position (but we do not require any n of them to be in general position). For such a web, we shall define some specific analytical subset S of M0 which ...

Let n be an integer and let F be a nonarchimedean local field whose characteristic is not a prime dividing n. Let μk be the group of k-th roots of unity in the algebraic closure of F ; we assume that μ2n ⊂ F . Let G be a split, simply-connected semisimple algebraic group over F . We assume that G is actually defined over the ring o of integers in F in such a way that K = G(o) is a special maxim...

We start by presenting a PCP system with two queries as a graph. The vertices correspond to locations of the proof. The edges correspond to tests made by the verifier on the two endpoints. Each vertex is assigned a symbol from an alphabet Σ by the prover. Each edge is associated with a constraint on pairs in Σ×Σ. Note that the definition of “degree” we had before coincides with the definition o...