Related papers: Counting the Number of Site Swap Juggling Patterns…
A strict local martingale is a local martingale which is not a martingale. There are few explicit examples of "naturally occurring" strict local martingales with jumps available in the literature. The purpose of this paper is to provide…
We consider an online ad network problem in which an ad exchange auctions ad slots and intermediaries called demand side platforms (DSPs) buy these ad slots for their clients (advertisers). An intermediary represents multiple advertisers.…
In algebraic geometry there is the notion of a height pairing of algebraic cycles, which lies at the confluence of arithmetic, Hodge theory and topology. After explaining a motivating example situation, we introduce new directions in this…
Shuffle algebra has been employed to give a proof of the duality theorem for multiple zeta-star values of height one.
We examine a family of discrete probability distributions that describes the "spillage number" in the extended balls-in-bins model. The spillage number is defined as the number of balls that occupy their bins minus the total number of…
The Web Geometry Laboratory (WGL) is a collaborative and adaptive e-learning Web platform integrating a well known dynamic geometry system. Thousands of Geometric problems for Geometric Theorem Provers (TGTP) is a Web-based repository of…
We study the problem of designing systems in order to minimize cost while meeting a given flexibility target. Flexibility is attained by enforcing a joint chance constraint, which ensures that the system will exhibit feasible operation with…
The main result is a wall crossing formula for central projections defined on submanifolds of a real projective space. Our formula gives the jump of the degree of such a projection when the center of the projection varies. The fact that the…
A fork stack is a generalised stack which allows pushes and pops of several items at a time. We consider the problem of determining which input streams can be sorted using a single forkstack, or dually, which permutations of a fixed input…
In this survey article, we summarize some recent progress and problems on the symplectomorphism groups, with an emphasis on the connection to the space of ball-packings.
When shuffling a deck of cards, one probably wants to make sure it is thoroughly shuffled. A way to do this is by sifting through the cards to ensure that no adjacent cards are the same number, because surely this is a poorly shuffled deck.…
We derive a combinatorial equilibrium for bounded juggling patterns with a random, $q$-geometric throw distribution. The dynamics are analyzed via rook placements on staircase Ferrers boards, which leads to a steady-state distribution…
In this note we give exact formulas (and asymptotics) for the number of rational points of bounded height on weighted projective stacks over global function fields.
Local search is a widely used technique for tackling challenging optimization problems, offering significant advantages in terms of computational efficiency and exhibiting strong empirical behavior across a wide range of problem domains. In…
A promising research area that has recently emerged, is on how to use index coding to improve the communication efficiency in distributed computing systems, especially for data shuffling in iterative computations. In this paper, we posit…
Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets. We prove however that the…
We consider a card guessing game with complete feedback. An ordered deck of $n$ cards labeled $1$ up to $n$ is riffle-shuffled exactly one time. Given a value $p\in(0{,}1)\setminus\{\frac12\}$, the riffle shuffle is assumed to be…
We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…
For providing quick and accurate results, a search engine maintains a local snapshot of the entire web. And, to keep this local cache fresh, it employs a crawler for tracking changes across various web pages. However, finite bandwidth…
Cluster number counts can be used to test dark energy models. We investigate dark energy candidates which are coupled to dark matter. We analyze the cluster number counts dependence on the amount of dark matter coupled to dark energy.…