We present the latest developments on the number of (≤ k)-sets and halving lines for (generalized) configurations of points; as well as the rectilinear and pseudolinear crossing numbers of Kn. In particular, we define perfect generalized configurations on n points as those whose number of (≤ k)-sets is exactly 3¡k+1 2 ¢ for all k ≤ n/3. We conjecture that for each n there is a perfect configura...

We study the kernels Kn,s(z) in the remainder terms Rn,s(f) of the Gauss-Turán quadrature formulae for analytic functions on elliptical contours with foci at ±1, when the weight ω is a generalized Chebyshev weight function. For the generalized Chebyshev weight of the first (third) kind, it is shown that the modulus of the kernel |Kn,s(z)| attains its maximum on the real axis (positive real semi...

We consider a generalized form of the coupon collection problem in which a random number, S, of balls is drawn at each stage from an urn initially containing n white balls (coupons). Each white ball drawn is colored red and returned to the urn; red balls drawn are simply returned to the urn. The question considered is then: how many white balls (uncollected coupons) remain in the urn after the ...

Here BΓ is the classifying space of the group Γ, and we denote by K−∞(R) the non-connective algebraic K-theory spectrum of the ring R. The homotopy groups of this spectrum are denoted Kn(R) and coincide with Quillen’s algebraic K-groups of R [Qui73] in positive dimensions and with the negative K-groups of Bass [Bas68] in negative dimensions. The homotopy groups of the spectrum X+∧K(R) are denot...

We are seeking a sufficient condition that forces a transversal in a generalized Latin square. A generalized Latin square of order n is equivalent to a proper edge-coloring of Kn,n. A transversal corresponds to a multicolored perfect matching. Akbari and Alipour defined l(n) as the least integer such that every properly edge-colored Kn,n, which contains at least l(n) different colors, admits a ...

Recently, Aichholzer, Garćıa, Orden, and Ramos derived a remarkably improved lower bound for the number of (≤ k)-edges in an n-point set, and as an immediate corollary an improved lower bound on the rectilinear crossing number of Kn. We use simple allowable sequences to extend all their results to the more general setting of simple generalized configurations of points and slightly improve the l...

We examine Generalized Towers of Hanoi, Generalized Spin-Out, and the Combination Puzzle, and continue to describe the puzzles and their properties. We introduce Finite State Transducers (FSTs) that compute the shortest sequence of winning moves for each of these puzzles for all dimensions, and show that the solution sequence for Spin-Out is not finite-state computable when going from configura...

We consider a generalized model of repeated quantum interactions, where a system H is interacting in a random way with a sequence of independent quantum systems Kn, n > 1. Two types of randomness are studied in detail. One is provided by considering Haar-distributed unitaries to describe each interaction between H and Kn. The other involves random quantum states describing each copy Kn. In the ...