Results 51 to 60 of about 3,028 (216)
Perfect Matching Under Precedence Constraints
ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
Rigged configurations of type $D_4^{(3)}$ and the filling map [PDF]
We give a statistic preserving bijection from rigged configurations to a tensor product of Kirillov–Reshetikhin crystals $\otimes_{i=1}^{N}B^{1,s_i}$ in type $D_4^{(3)}$ by using virtualization into type $D_4^{(1)}$.
Travis Scrimshaw
doaj +1 more source
A bijection for nonorientable general maps [PDF]
We give a different presentation of a recent bijection due to Chapuy and Dołe ̨ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps.
Jérémie Bettinelli
doaj +1 more source
From tetrachoric to kappa: How to assess reliability on binary scales
Abstract Reliability is crucial in psychometrics, reflecting the extent to which a measurement instrument can discriminate between individuals or items. While classical test theory and intraclass correlation coefficients are well‐established for quantitative scales, estimating reliability for binary outcomes presents unique challenges due to their ...
Sophie Vanbelle
wiley +1 more source
A bijection between shrubs and series-parallel posets [PDF]
Motivated by the theory of operads, we introduce new combinatorial objects, called shrubs, that generalize forests of rooted trees. We show that the species of shrubs is isomorphic to the species of series-parallel posets.
Frédéric Chapoton
doaj +1 more source
Density‐Valued ARMA Models by Spline Mixtures
ABSTRACT This paper proposes a novel framework for modeling time series of probability density functions by extending autoregressive moving average (ARMA) models to density‐valued data. The method is based on a transformation approach, wherein each density function on a compact domain [0,1]d$$ {\left[0,1\right]}^d $$ is approximated by a B‐spline ...
Yasumasa Matsuda, Rei Iwafuchi
wiley +1 more source
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
Let \(S_ n\supseteq S_ n'\), \(T_ n\supseteq T_ n'\) with \(| S_ n| \sim | S_ n'|\) and \(| T_ n\sim | T_ n'|\) as \(n\to \infty\). If there exist bijections \(\Phi_ n\) from \(S_ n'\) to \(T_ n'\) then \(\Phi_ n\) is called an asymptotic bijection from \(S_ n\) to \(T_ n\). Using this idea, the authors verify the partition formula: \(B_ r=e^{-1}\sum^{\
Bender, Edward A, Zeilberger, Doron
openaire +1 more source
ABSTRACT How should we understand the duration of a pleasant or unpleasant sensation, insofar as its duration modulates how good or bad the experience is overall? Given that we seem able to distinguish between subjective and objective duration and that how well or badly someone's life goes is naturally thought of as something to be assessed from her ...
Andreas L. Mogensen
wiley +1 more source
A Bijection for Directed-Convex Polyominoes [PDF]
In this paper we consider two classes of lattice paths on the plane which use \textitnorth, \textiteast, \textitsouth,and \textitwest unitary steps, beginningand ending at (0,0).We enumerate them according to the number ofsteps by means of bijective ...
Alberto Del Lungo +3 more
doaj +1 more source

