12,877 research outputs found

    Riordan Paths and Derangements

    Full text link
    Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and (321,31ˉ42)(321,3\bar{1}42)-avoiding derangements. We also present a combinatorial proof of a recurrence relation for the Riordan numbers in the spirit of the Foata-Zeilberger proof of a recurrence relation on the Schr\"oder numbers.Comment: 9 pages, 2 figure

    Rank Minimization over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations

    Full text link
    This paper establishes information-theoretic limits in estimating a finite field low-rank matrix given random linear measurements of it. These linear measurements are obtained by taking inner products of the low-rank matrix with random sensing matrices. Necessary and sufficient conditions on the number of measurements required are provided. It is shown that these conditions are sharp and the minimum-rank decoder is asymptotically optimal. The reliability function of this decoder is also derived by appealing to de Caen's lower bound on the probability of a union. The sufficient condition also holds when the sensing matrices are sparse - a scenario that may be amenable to efficient decoding. More precisely, it is shown that if the n\times n-sensing matrices contain, on average, \Omega(nlog n) entries, the number of measurements required is the same as that when the sensing matrices are dense and contain entries drawn uniformly at random from the field. Analogies are drawn between the above results and rank-metric codes in the coding theory literature. In fact, we are also strongly motivated by understanding when minimum rank distance decoding of random rank-metric codes succeeds. To this end, we derive distance properties of equiprobable and sparse rank-metric codes. These distance properties provide a precise geometric interpretation of the fact that the sparse ensemble requires as few measurements as the dense one. Finally, we provide a non-exhaustive procedure to search for the unknown low-rank matrix.Comment: Accepted to the IEEE Transactions on Information Theory; Presented at IEEE International Symposium on Information Theory (ISIT) 201

    Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths

    Get PDF
    The problem of counting plane trees with nn edges and an even or an odd number of leaves was studied by Eu, Liu and Yeh, in connection with an identity on coloring nets due to Stanley. This identity was also obtained by Bonin, Shapiro and Simion in their study of Schr\"oder paths, and it was recently derived by Coker using the Lagrange inversion formula. An equivalent problem for partitions was independently studied by Klazar. We present three parity reversing involutions, one for unlabelled plane trees, the other for labelled plane trees and one for 2-Motzkin paths which are in one-to-one correspondence with Dyck paths.Comment: 8 pages, 4 figure

    Gender in Engineering Departments: Are There Gender Differences in Interruptions of Academic Job Talks?

    Get PDF
    We use a case study of job talks in five engineering departments to analyze the under-studied area of gendered barriers to finalists for faculty positions. We focus on one segment of the interview day of short-listed candidates invited to campus: the “job talk”, when candidates present their original research to the academic department. We analyze video recordings of 119 job talks across five engineering departments at two Research 1 universities. Specifically, we analyze whether there are differences by gender or by years of post-Ph.D. experience in the number of interruptions, follow-up questions, and total questions that job candidates receive. We find that, compared to men, women receive more follow-up questions and more total questions. Moreover, a higher proportion of women’s talk time is taken up by the audience asking questions. Further, the number of questions is correlated with the job candidate’s statements and actions that reveal he or she is rushing to present their slides and complete the talk. We argue that women candidates face more interruptions and often have less time to bring their talk to a compelling conclusion, which is connected to the phenomenon of “stricter standards” of competence demanded by evaluators of short-listed women applying for a masculine-typed job. We conclude with policy recommendations
    • …
    corecore