中文
相关论文

相关论文: The dinner table problem: the rectangular case

200 篇论文

We consider equilibrium one-on-one conversations between neighbors on a circular table, with the goal of assessing the likelihood of a (perhaps) familiar situation: sitting at a table where both of your neighbors are talking to someone…

概率论 · 数学 2024-11-18 Kenny Peng

A detailed study is made of the number of occupied seats in an unfriendly seating scheme with two rows of seats. An unusual identity is derived for the probability generating function, which is itself an asymptotic expansion. The identity…

概率论 · 数学 2015-01-26 Hua-Huai Chern , Hsien-Kuei Hwang , Tsung-Hsi Tsai

We study the group Russian roulette problem, also known as the shooting problem, defined as follows. We have $n$ armed people in a room. At each chime of a clock, everyone shoots a random other person. The persons shot fall dead and the…

概率论 · 数学 2017-05-02 Tim van de Brug , Wouter Kager , Ronald Meester

Consider the group of $n$ men and $n$ women, each with their own preference list for a potential marriage partner. The stable marriage is a bipartite matching such that no unmatched pair (man, woman) prefer each other to their partners in…

组合数学 · 数学 2017-07-25 Boris Pittel

A group of $n$ agents with numerical preferences for each other are to be assigned to the $n$ seats of a dining table. We study two natural topologies:~circular (cycle) tables and panel (path) tables. For a given seating arrangement, an…

计算机科学与博弈论 · 计算机科学 2023-10-10 Damien Berriaud , Andrei Constantinescu , Roger Wattenhofer

We enumerate arrangements of $n$ couples, i.e. pairs of people, placed in a single-file queue, and consider four statistics from the vantage point of a distinguished given couple. In how many arrangements are exactly $p$ of the $n-1$ other…

组合数学 · 数学 2020-07-30 Donovan Young

A king invites n couples to sit around a round table with 2n+1 seats. For each couple, the king decides a prescribed distance d between 1 and n which the two spouses have to be seated from each other (distance d means that they are…

组合数学 · 数学 2010-06-15 Daniel Kohen , Ivan Sadofschi

Assume that $n = 2k$ potential roommates each have an ordered preference of the $n-1$ others. A stable matching is a perfect matching of the $n$ roommates in which no two unmatched people prefer each other to their matched partners. In…

组合数学 · 数学 2026-01-13 Byron Chin , Marcus Michelen

The exact computation of the nearest-neighbor spacing distribution P(s) is performed for a rectangular billiard with point-like scatterer inside for periodic and Dirichlet boundary conditions and it is demonstrated that for large s this…

混沌动力学 · 物理学 2009-11-07 E. Bogomolny , O. Giraud , C. Schmit

Let $n = b_1 + ... + b_k = b_1' + \cdot + b_k'$ be a pair of compositions of $n$ into $k$ positive parts. We say this pair is {\em irreducible} if there is no positive $j < k$ for which $b_1 + ... b_j = b_1' + ... b_j'$. The probability…

组合数学 · 数学 2007-05-23 Edward A. Bender , Gregory F. Lawler , Robin Pemantle , Herbert S. Wilf

Let $q \ge 3$ be a period. There are at least two $(1,q)$-periodic trajectories inside any smooth strictly convex billiard table, and all of them have the same length when the table is an ellipse or a circle. We quantify the chaotic…

动力系统 · 数学 2023-09-19 Pau Martín , Anna Tamarit-Sariol , Rafael Ramírez-Ros

We consider random polynomials whose coefficients are independent and uniform on {-1,1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^{-2}) when n+1 is not divisible by 4 and asymptotic to…

概率论 · 数学 2017-03-14 Ron Peled , Arnab Sen , Ofer Zeitouni

We investigate a disordered variant of Pitman's Chinese restaurant process where tables carry i.i.d. weights. Incoming customers choose to sit at an occupied table with a probability proportional to the product of its occupancy and its…

概率论 · 数学 2024-05-06 Jakob E. Björnberg , Cécile Mailler , Peter Mörters , Daniel Ueltschi

In this paper we study the number $M_{m,n}$ of ways to place nonattacking pawns on an $m\times n$ chessboard. We find an upper bound for $M_{m,n}$ and analyse its asymptotic behavior. It turns out that $\lim_{m,n\to\infty}(M_{m,n})^{1/mn}$…

组合数学 · 数学 2007-05-23 S. Kitaev , T. Mansour

We address the question of the infinitude of twin and cousin prime pairs from a probabilistic perspective. Our approach partitions the set of integer numbers greater than $2$ in finite intervals of the form $[p_{n-1}^2,p_n^2)$, $p_{n-1}$…

数论 · 数学 2023-04-03 Daniele Bufalo , Michele Bufalo , Felice Iavernaro

The stable roommates problem does not necessarily have a solution, i.e. a stable matching. We had found that, for the uniformly random instance, the expected number of solutions converges to $e^{1/2}$ as $n$, the number of members, grows,…

组合数学 · 数学 2017-05-24 Boris Pittel

In the open circular billiard particles are placed initially with a uniform distribution in their positions inside a planar circular vesicle. They all have velocities of the same magnitude, whose initial directions are also uniformly…

统计力学 · 物理学 2009-11-11 J. F. Stilck

The well-known asymptotic formula for the module of a condenser with one of the plates degenerating to a point is generalized to the case of a condenser of general type. The condensers under consideration consist of n plates, n > 2, and the…

复变函数 · 数学 2011-10-18 V . N . Dubinin

We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…

概率论 · 数学 2023-01-03 Tiefeng Jiang , Ke Wang

We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…

组合数学 · 数学 2014-11-14 Igor Kortchemski
‹ 上一页 1 2 3 10 下一页 ›