Even-cycle matroids are elementary lifts of graphic and even-cut cographic matroids. We present a polynomial algorithm to check if binary matroid is an even-cycle we matroid. These two algorithms rely on (to be described in pair follow-up papers) pinch-graphic.

The even-even Ytterbium isotopes lack spectroscopic information with the increase of neutron number and they are well deformed nuclei, presenting rotational properties. In this mass region nuclear chart predictions have shown rare phenomena related to structure, such as shape coexistence. work population excited states were investigated in Yb via 2n-transfer reaction 168-174Yb (18O, 16O) 170-17...

We study the classic cake cutting problem from a mechanism design perspective, in particular focusing on deterministic mechanisms that are strategyproof and fair. We begin by looking at mechanisms that are non-wasteful and primarily show that for even the restricted class of piecewise constant valuations there exists no direct-revelation mechanism that is strategyproof and even approximately pr...

Let C be a binary extremal self-dual doubly-even code of length n ≥ 48. If such a code has an automorphism σ of prime order p ≥ 5 then the number of fixed points in the permutation action on the coordinates is bounded by the number of p-cycles. It turns out that large primes p, i.e. n − p small, occur extremely rarely in Aut(C). Examples are the extended quadratic residue codes. We prove that d...