中文
相关论文

相关论文: On explicit random-like tournaments

200 篇论文

We discuss consequences of a recent observation that the sequence of periodic orbits in a chaotic billiard behaves like a poissonian stochastic process on small scales. This enables the semiclassical form factor $K_{sc}(\tau)$ to agree with…

chao-dyn · 物理学 2009-10-28 Per Dahlqvist

We give a new characterization of skew Hadamard matrices of size $n$ in terms of the data of the spectra of tournaments of size $n-2$.

组合数学 · 数学 2012-02-27 Hiroshi Nozaki , Sho Suda

Linial and Morgenstern conjectured that, among all $n$-vertex tournaments with $d\binom{n}{3}$ cycles of length three, the number of cycles of length four is asymptotically minimized by a random blow-up of a transitive tournament with all…

组合数学 · 数学 2019-09-16 Timothy F. N. Chan , Andrzej Grzesik , Daniel Kral , Jonathan A. Noel

An {\it inversion} of a tournament $T$ is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let ${\rm inv}_k(T)$ be the minimum length of a sequence of inversions using sets of size at most $k$…

组合数学 · 数学 2023-12-05 Raphael Yuster

A fundamental property of choice functions is stability, which, loosely speaking, prescribes that choice sets are invariant under adding and removing unchosen alternatives. We provide several structural insights that improve our…

理论经济学 · 经济学 2020-04-06 Felix Brandt , Markus Brill , Hans Georg Seedig , Warut Suksompong

We study the relationship between tournaments and random walks. This connection was first observed by Erd\H{o}s and Moser. Winston and Kleitman came close to showing that $S_n=\Theta(4^n/n^{5/2})$. Building on this, and works by Tak\'acs,…

概率论 · 数学 2024-06-03 Serte Donderwinkel , Brett Kolesnik

We establish, for the first time, a connection between stochastic games and multiparameter eigenvalue problems, using the theory developed by Shapley and Snow (1950). This connection provides new results, new proofs, and new tools for…

最优化与控制 · 数学 2019-05-23 Luc Attia , Miquel Oliu-Barton

A tournament is called locally transitive if the outneighbourhood and the inneighbourhood of every vertex are transitive. Equivalently, a tournament is locally transitive if it avoids the tournaments $W_4$ and $L_4$, which are the only…

组合数学 · 数学 2015-04-16 Leonardo Nagami Coregliano

The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…

偏微分方程分析 · 数学 2025-01-23 Masato Hoshino

A certain sampling process, concerning an urn with balls of two colors, proposed in 1965 by B.E. Oakley and R.L. Perry, and discussed by Peter Winkler and Martin Gardner, that has an extremely simple answer for the probability, namely the…

组合数学 · 数学 2018-01-08 Shalosh B. Ekhad , Doron Zeilberger

A tournament on a graph is an orientation of its edges. The score sequence lists the in-degrees in non-decreasing order. Works by Winston and Kleitman (1983) and Kim and Pittel (2000) showed that the number $S_n$ of score sequences on the…

组合数学 · 数学 2025-11-18 Brett Kolesnik

This article deals with certain star variants of the Scheepers property. We introduce and study the star-$K$-Scheepers property and corresponding game. The relationships between the game corresponding to the star-$K$-Scheepers property and…

一般拓扑 · 数学 2023-05-09 Debraj Chandra , Nur Alam

A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is `pseudorandom', meaning that, for instance,…

组合数学 · 数学 2020-11-18 Stefan Ehard , Stefan Glock , Felix Joos

I provide simplified proofs for each of the following fundamental theorems regarding selection principles: 1. The Quasinormal Convergence Theorem, due to the author and Zdomskyy, asserting that a certain, important property of the space of…

一般拓扑 · 数学 2024-06-05 Boaz Tsaban

We consider a 2-player permutation game inspired by the celebrated Erd\H{o}s-Szekeres Theorem. The game depends on two positive integer parameters $a$ and $b$ and we determine the winner and give a winning strategy when $a \geq b$ and $b…

组合数学 · 数学 2026-03-10 Lara Pudwell

The Erd\H{o}s-Hajnal Conjecture states that for every $H$ there exists a constant $\epsilon(H)>0$ such that every graph $G$ that does not contain $H$ as an induced subgraph contains a clique or a stable set of size at least…

组合数学 · 数学 2014-10-28 Krzysztof Choromanski

A very nice result of B\'ar\'any and Lehel asserts that every finite subset $X$ or $\mathbb R^d$ can be covered by $f(d)$ $X$-boxes (i.e. each box has two antipodal points in $X$). As shown by Gy\'arf\'as and P\'alv\H{o}lgyi this result…

组合数学 · 数学 2017-03-24 N. Bousquet , W. Lochet , S. Thomassé

The fundamental aim of this paper is to introduce and investigate a new property of quasi 2-normed space based on a question given by C. Park (2006) [2] for the completion quasi 2-normed space. Finally, we also find an answer for a question…

组合数学 · 数学 2019-07-04 Mehmet Kir , Mehmet Acikgoz

In this note we are interested in a relevant generalized Nash equilibrium problem, which was proposed by Rosen in 1965. An existence result is established in the general setting of quasiconvexity, which is independent from the one given by…

最优化与控制 · 数学 2022-01-13 Orestes Bueno , Carlos Calderon , John Cotrina

We discuss in detail two recently proposed relations between the Parrondo's games and the Fokker--Planck equation describing the flashing ratchet as the overdamped motion of a particle in a potential landscape. In both cases it is possible…

统计力学 · 物理学 2009-11-10 R. Toral , P. Amengual , S. Mangioni