Pages that link to "Item:Q2250288"

The following pages link to Problems from the discrete to the continuous. Probability, number theory, graph theory, and combinatorics (Q2250288):

Displaying 13 items.

• Generalized lattice-point visibility in \(\mathbb{N}^k\) (Q2037252) (← links)
• Discretization of the parking problem (Q2668890) (← links)
• Asymptotic normality in a discrete analog of the parking problem (Q2684697) (← links)
• Probability on trees and networks (Q2833171) (← links)
• Last-Mile Shared Delivery: A Discrete Sequential Packing Approach (Q3387932) (← links)
• (Q4041008) (← links)
• Lattice Point Visibility on Generalized Lines of Sight (Q4577959) (← links)
• A view from the bridge spanning combinatorics and probability (Q5054893) (← links)
• The Infinite limit of random permutations avoiding patterns of length three (Q5222575) (← links)
• Lattice point visibility on power functions (Q5384306) (← links)
• One-sided selfish parking (Q6132524) (← links)
• Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns (Q6611742) (← links)
• A continuous version of the selfish parking problem (Q6638377) (← links)