نتایج جستجو برای: maximal and minimal rank

تعداد نتایج: 16858006  

Journal: :CoRR 2011
Markus Perling

We study equivariant resolutions and local cohomologies of toric sheaves for affine toric varieties, where our focus is on the construction of new examples of indecomposable maximal Cohen-Macaulay modules of higher rank. A result of Klyachko states that the category of reflexive toric sheaves is equivalent to the category of vector spaces together with a certain family of filtrations. Within th...

Journal: :Journal of Pure and Applied Algebra 2009

Journal: :Canadian Mathematical Bulletin 2014

Journal: :Finite Fields and Their Applications 2010

Journal: :Journal of Number Theory 2021

Given a subset W of an abelian group G, C is called additive complement for if W+C=G; if, moreover, no proper has this property, then we say that minimal W. It natural to ask which subsets can arise as complements some We show in finite every non-empty size |C|≤22/3|G|1/3/((3elog⁡|G|)2/3 As corollary, deduce infinite complement. also derive several analogous results “dual” problems about maxima...

2008
Rafik Aguech Nabil Lasmar Hosam Mahmoud

We consider weighted path lengths to the extremal leaves in a random binary search tree. When linearly scaled, the weighted path length to the minimal label has Dickman’s infinitely divisible distribution as a limit. By contrast, the weighted path length to the maximal label needs to be centered and scaled to converge to a standard normal variate in distribution. The exercise shows that path le...

Kh. Abolpour, M. M. Zahedi, M. Shamsizadeh

In this note, we define the concepts of admissible relation and admissible partition for an arbitrary BL-general fuzzy automaton.In particular, a connection between the admissible partition and the quotient BL-general fuzzy automaton is presented.It is shown that if we use the maximal admissible partition, then we obtain a quotient BL-general fuzzy automaton and this quotient is minimal. Finall...

2014
Pratik Ghoshal Meghana Nasre Prajakta Nimbhorkar

Let G = (A ∪ P , E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M in G is rank-maximal if it matches the maximum number of applicants to their top-rank post, subject to this, the maximum number of applicants to their second rank

Journal: :iranian journal of fuzzy systems 2010
s ngcibi v murali b. b makamba

in this paper we enumerate fuzzy subgroups, up to a natural equivalence, of some finite abelian p-groups of rank two where p is any prime number. after obtaining the number of maximal chains of subgroups, we count fuzzy subgroups using inductive arguments. the number of such fuzzy subgroups forms a polynomial in p with pleasing combinatorial coefficients. by exploiting the order, we label the s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید