Results 61 to 70 of about 116,873 (193)
Operators of equivalent sorting power and related Wilf-equivalences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We study sorting operators $\textrm{A}$ on permutations that are obtained composing Knuth's stack sorting operator \textrmS and the reverse operator $\textrm{R}$, as many times as desired.
Michael Albert, Mathilde Bouvel
doaj +1 more source
A Bijection for Tricellular Maps
ISRN Discrete Mathematics, 2013 We give a bijective proof for a relation between unicellular, bicellular, and tricellular maps. These maps represent cell complexes of orientable surfaces having one, two, or three boundary components. The relation can formally be obtained using matrix theory (Dyson, 1949) employing the Schwinger-Dyson equation (Schwinger, 1951).
Han, Hillary Siwei, Reidys, Christian
openaire +4 more sources
Aggregation and the Structure of Value
Noûs, EarlyView.ABSTRACT Roughly, the view I call “Additivism” sums up value across time and people. Given some standard assumptions, I show that Additivism follows from two principles. The first says that how lives align in time cannot, in itself, matter. The second says, roughly, that a world cannot be better unless it is better within some period or another.
Weng Kin San
wiley +1 more source
A bijection between irreducible k-shapes and surjective pistols of height $k-1$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 This paper constructs a bijection between irreducible $k$-shapes and surjective pistols of height $k-1$, which carries the "free $k$-sites" to the fixed points of surjective pistols.
Ange Bigeni
doaj +1 more source
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
On computing local monodromy and the numerical local irreducible decomposition
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
Generating Bijections between HOAS and the Natural Numbers [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 A provably correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a ``not equals'' relationship between terms and also to have an adequate encoding of sets of terms, and maps from one term family to ...
John Tang Boyland
doaj +1 more source
International Transactions in Operational Research, Volume 33, Issue 3, Page 1525-1558, May 2026.Abstract In the last decade, explainability has been attracting much attention in the machine learning community. However, this research topic extends beyond this field to encompass others such as operations research and combinatorial optimization (CO).
Mathieu Lerouge +3 more
wiley +1 more source
An allocation rule for connection scheduling problems
International Transactions in Operational Research, Volume 33, Issue 2, Page 892-925, March 2026.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
Bijections for Dyck paths with colored hills [PDF]
Enumerative Combinatorics and Applications, 2022 Kostas Manes, Ioannis Tasoulas
doaj +1 more source