Results 101 to 110 of about 132,418 (291)
Dyck tilings, linear extensions, descents, and inversions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths.
Jang Soo Kim +3 more
doaj +1 more source
Reductions of Young Tableau Bijections [PDF]
SIAM Journal on Discrete Mathematics, 2010 We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a number of classical bijections, and establish formal connections between them.
Ernesto Vallejo, Igor Pak
openaire +3 more sources
An allocation rule for connection scheduling problems
International Transactions in Operational Research, EarlyView.Abstract This paper studies so‐called connection scheduling problems, a type of interactive operations research problem. A connection scheduling problem combines aspects from the minimum cost spanning tree and sequencing problems. Given a graph, we aim to first establish a connection order on the players such that the total cost of connecting them to a
Laura Davila‐Pena +3 more
wiley +1 more source
Algebraic properties for some permutation statistics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 In this article, we study some quotient sets on permutations built from peaks, valleys, double rises and double descents. One part is dedicated to the enumeration of the cosets using the bijection of Francon-Viennot which is a bijection between ...
Vincent Vong
doaj +1 more source
On the analytic bijections of the rationals in [0,1] [PDF]
Rendiconti Lincei, Matematica e Applicazioni, 2017 We carry out an arithmetical study of analytic functions f: [0,1] \to [0,1] that by restriction induce a bijection \mathbb{Q} \cap [0,1] \to \mathbb{Q} \cap [0,1] . The existence of such functions shows that, unless
openaire +4 more sources
Noûs, EarlyView.Abstract Standard decision theory ranks risky prospects by their expected utility. This ranking does not change if the values of all possible outcomes are uniformly shifted or dilated. Similarly, if the values of the outcomes are negated, the ranking of prospects by their expected utility is reversed.
Zachary Goodsell
wiley +1 more source
Type C parking functions and a zeta map [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We introduce type $C$ parking functions, encoded as vertically labelled lattice paths and endowed with a statistic dinv'. We define a bijection from type $C$ parking functions to regions of the Shi arrangement of type $C$, encoded as diagonally labelled ...
Robin Sulzgruber, Marko Thiel
doaj +1 more source
A Bijective Proof for a Theorem of Ehrhart [PDF]
American Mathematical Monthly, 2009 We give a new proof for a theorem of Ehrhart regarding the quasi-polynomiality of the function that counts the number of integer points in the integral dilates of a rational polytope. The proof involves a geometric bijection, inclusion-exclusion, and recurrence relations, and we also prove Ehrhart reciprocity using these methods.
openaire +3 more sources
A New Hilbert's Hotel Argument Against Past‐Eternalism
Analytic Philosophy, EarlyView.ABSTRACT This paper offers a new formulation of the “Hilbert's Hotel Argument” (HHA) which is superior to existing formulations because it (1) demonstrates that HH is logically impossible in the concrete world, (2) takes into account the need to consider the assumptions of HHA, and (3) offers a reply to an important objection concerning the validity of
Andrew Ter Ern Loke, Eli Haitov
wiley +1 more source