Zobrazeno 1 - 10
of 1 852
pro vyhledávání: '"Mori, J"'
Given a collection of historical sports rankings, can one tell which player is the greatest of all time (i.e., the GOAT)? In this work, we design a data-driven random walk on the symmetric group to obtain a stationary distribution over player ranking
Externí odkaz:
http://arxiv.org/abs/2409.12107
Autor:
Mori, J. Carlos Martínez
In this expository article I describe classical results in the combinatorics of parking functions. Its English-Spanish translation is included. -- -- En este art\'iculo de difusi\'on matem\'atica describo resultados cl\'asicos en la combinatoria de f
Externí odkaz:
http://arxiv.org/abs/2404.15372
Given a Coxeter group $W$ with Coxeter system $(W,S)$, where $S$ is finite. We provide a complete characterization of Boolean intervals in the weak order of $W$ uniformly for all Coxeter groups in terms of independent sets of the Coxeter graph. Moreo
Externí odkaz:
http://arxiv.org/abs/2403.07989
An urban planner might design the spatial layout of transportation amenities so as to improve accessibility for underserved communities -- a fairness objective. However, implementing such a design might trigger processes of neighborhood change that c
Externí odkaz:
http://arxiv.org/abs/2401.03307
Autor:
Aguilar-Fraga, Tomás, Elder, Jennifer, Garcia, Rebecca E., Hadaway, Kimberly P., Harris, Pamela E., Harry, Kimberly J., Hogan, Imhotep B., Johnson, Jakeyl, Kretschmann, Jan, Lawson-Chavanu, Kobe, Mori, J. Carlos Martínez, Monroe, Casandra D., Quiñonez, Daniel, Tolson III, Dirk, Williams II, Dwight Anderson
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 26:1, Permutation Patterns 2023, Combinatorics (November 4, 2024) dmtcs:12598
Interval parking functions are a generalization of parking functions in which cars have an interval preference for their parking. We generalize this definition to parking functions with $n$ cars and $m\geq n$ parking spots, which we call interval rat
Externí odkaz:
http://arxiv.org/abs/2311.14055
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 26:3, Combinatorics (November 4, 2024) dmtcs:13113
In this paper, we study the total displacement statistic of parking functions from the perspective of cooperative game theory. We introduce parking games, which are coalitional cost-sharing games in characteristic function form derived from the total
Externí odkaz:
http://arxiv.org/abs/2309.12265
Graphical designs are a framework for sampling and numerical integration of functions on graphs. In this note, we introduce a method to address the trade-off between graphical design sparsity and accuracy. We show how to obtain sparse graphical desig
Externí odkaz:
http://arxiv.org/abs/2309.00765
Let $\mathfrak{S}_n$ denote the symmetric group and let $W(\mathfrak{S}_n)$ denote the weak order of $\mathfrak{S}_n$. Through a surprising connection to a subset of parking functions, which we call unit Fubini rankings, we provide a complete charact
Externí odkaz:
http://arxiv.org/abs/2306.14734
Quicksort is a classical divide-and-conquer sorting algorithm. It is a comparison sort that makes an average of $2(n+1)H_n - 4n$ comparisons on an array of size $n$ ordered uniformly at random, where $H_n = \sum_{i=1}^n\frac{1}{i}$ is the $n$th harmo
Externí odkaz:
http://arxiv.org/abs/2306.13065
Autor:
Pavia, Sophie, Mori, J. Carlos Martinez, Sharma, Aryaman, Pugliese, Philip, Dubey, Abhishek, Samaranayake, Samitha, Mukhopadhyay, Ayan
Public transit is an essential infrastructure enabling access to employment, healthcare, education, and recreational facilities. While accessibility to transit is important in general, some sections of the population depend critically on transit. How
Externí odkaz:
http://arxiv.org/abs/2212.12007