Results 11 to 20 of about 988,365 (280)
ACM Transactions on Algorithms, 2006 Suppose that each member of a set A of applicants ranks a subset of a set P of posts in an order of preference, possibly involving ties. A matching is a set of (applicant, post) pairs such that each applicant and each post appears in at most one pair.
Robert W. Irving +4 more
core +18 more sources
Commuting Nilpotent Operators and Maximal Rank
Complex Analysis and Operator Theory, 2009 The main result of this note is the following. Let \(X,X_1 ,\dots,X_s\) be \(d \times d\) pairwise commuting nilpotent matrices over a field of characteristic \(p\) with nilpotencies \(p^n,p^{n_1},\dots,p^{n_s}\) respectively, where \(n \geqslant n_1 \geqslant n_2 \geqslant \dots \geqslant n_s\). Let \(f \in k[t_1,\dots,t_s]\) be a polynomial having no
ÖZTÜRK, SEMRA
core +4 more sources
ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES [PDF]
The Quarterly Journal of Mathematics, 1985 Let \({\mathfrak A}\) be a finite subset of nonzero matrices in the vector space \(M_ n(F)\) of all \(n\times n\) matrices over a field F, and let W be the subspace which \({\mathfrak A}\) spans. For each nonzero matrix T in \(M_ n(F)\) define p(T) to be the first index pair (i,j) in the lexico- graphical ordering for which the (i,j)-th entry of T is ...
Roy Meshulam
openaire +2 more sources
$p$-groups with maximal elementary abelian subgroups of rank $2$ [PDF]
, 2010 Let p be an odd prime number and G a finite p-group. We prove that if the rank of G is greater than p, then G has no maximal elementary abelian subgroup of rank 2.
Mazza, Nadia, Glauberman, George
core +5 more sources
Rank 3 permuation characters and maximal subgroups [PDF]
, 2009 Let G be a transitive permutation group acting on a finite set E. Let P be a stabilizer in G of a point in E. We say G is primitive rank 3 on E if P is maximal in G and P has exactly three orbits on E. For any subgroup H of G, we denote by 1 \(\frac{G}{H}
Tong Viet, Hung Phi
core +7 more sources
, 2018 Let C be a general curve of genus g, embedded in Pr via a general linear series of degree d. In this thesis, we prove the Maximal Rank Conjecture, which determines the Hilbert function of C Pr.
Larson, Eric Kerner
openaire +2 more sources
Revenue Maximization and Learning in Products Ranking [PDF]
Proceedings of the 22nd ACM Conference on Economics and Computation, 2021 The Price of Attention: Ranking Products for Maximum Revenue How should an online retailer rank products when customers have limited attention spans? Chen, Li, and Yang tackle this classic problem by extending the well-known cascade model to account for two crucial, real-world factors: customers view only a random number of items, and
Ningyuan Chen, Anran Li, Shuoguang Yang
openaire +3 more sources
Connected components of the category of elementary abelian $p$-subgroups. [PDF]
, 2008 We determine the maximal number of conjugacy classes of maximal elementary abelian subgroups of rank $2$ in a finite $p$-group $G$, for an odd prime $p$. Namely, it is $p$ if $G$ has rank at least $3$ and it is $p+1$ if $G$ has rank $2$.
Mazza, Nadia
core +4 more sources
Rank-maximal matchings – structure and algorithms [PDF]
Theoretical Computer Science, 2014 Let G = (A U 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 post and so ...
Pratik Ghosal +2 more
openaire +4 more sources
European Journal of Mathematics, 2022 AbstractWe give an upper-bound for the X-rank of points with respect to a non-degenerate irreducible variety X in the case that sub-generic X-rank points generate a hypersurface.
Bernardi, Alessandra +1 more
openaire +3 more sources