English
Related papers

Related papers: Strictly monotonic multidimensional sequences and …

200 papers

A matching game is a cooperative profit game defined on an edge-weighted graph, where the players are the vertices and the profit of a coalition is the maximum weight of matchings in the subgraph induced by the coalition. A population…

Computer Science and Game Theory · Computer Science 2021-05-04 Han Xiao , Qizhi Fang

We extend the results of our recent preprint [arXiv: 1811.00515] into higher dimensions $n \geq 4$. For minimizing harmonic maps $u\in W^{1,2}(\Omega,\mathbb{S}^2)$ from $n$-dimensional domains into the two dimensional sphere we prove: (1)…

Analysis of PDEs · Mathematics 2019-02-11 Katarzyna Mazowiecka , Michał Miśkiewicz , Armin Schikorra

Let $A, B\subseteq \mathbb{R}^2$ be finite, nonempty subsets, let $s\geq 2$ be an integer, and let $h_1(A,B)$ denote the minimal number $t$ such that there exist $2t$ (not necessarily distinct) parallel lines,…

Combinatorics · Mathematics 2007-10-17 David J. Grynkiewicz , Oriol Serra

In this paper we show that when individuals in a bipartite network exclusively choose partners and exchange valued goods with their partners, then there exists a set of exchanges that are pair-wise stable. Pair-wise stability implies that…

Computer Science and Game Theory · Computer Science 2010-11-12 Ankur Mani , Asuman Ozdaglar , Alex , Pentland

Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…

Number Theory · Mathematics 2023-01-03 Stefan Steinerberger

We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…

Probability · Mathematics 2017-04-28 Aneta Buraczyńska , Anna Dembińska

We study a variant of Erd\H os' unit distance problem, concerning dot products between successive pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of nonzero dot…

Combinatorics · Mathematics 2020-09-09 Shelby Kilmer , Caleb Marshall , Steven Senger

For a topological space $X$ and a point $x \in X$, consider the following game -- related to the property of $X$ being countably tight at $x$. In each inning $n\in\omega$, the first player chooses a set $A_n$ that clusters at $x$, and then…

General Topology · Mathematics 2016-04-01 Leandro F. Aurichi , Angelo Bella , Rodrigo R. Dias

In this paper, we investigate the robustness to external disturbances of switched discrete and continuous systems with multiple equilibria. It is shown that if each subsystem of the switched system is Input-to-State Stable (ISS), then under…

Systems and Control · Computer Science 2018-09-11 Sushant Veer , Ioannis Poulakakis

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Combinatorics · Mathematics 2019-05-06 Marcelo Soares Campos

We investigate ergodic-theoretical quantities and large deviation properties of one-dimensional intermittent maps, that have not only an indifferent fixed point but also a singular structure such that the uniform measure is invariant under…

Chaotic Dynamics · Physics 2015-06-18 Soya Shinkai , Yoji Aizawa

If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$ in the graph $G$, then it is called the independence polynomial of $G$ (Gutman and Harary, 1983). Let $a$ be the size of a…

Combinatorics · Mathematics 2007-05-23 Vadim E. Levit , Eugen Mandrescu

It is well known that almost every dilation of a sequence of real numbers, that diverges to $\infty$, is dense modulo~1. This paper studies the exceptional set of points -- those for which the dilation is not dense. Specifically, we…

Number Theory · Mathematics 2024-09-04 Daniel Berend , Michael D. Boshernitzan , Grigori Kolesnik , Rishi Kumar

We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical…

Computer Science and Game Theory · Computer Science 2010-12-13 Sachin Adlakha , Ramesh Johari

In this paper, we consider stochastic monotone Nash games where each player's strategy set is characterized by possibly a large number of explicit convex constraint inequalities. Notably, the functional constraints of each player may depend…

Optimization and Control · Mathematics 2023-08-25 Zeinab Alizadeh , Afrooz Jalilzadeh , Farzad Yousefian

We consider piecewise expanding maps of the interval with finitely many branches of monotonicity and show that they are generically combinatorially stable, i.e., the number of ergodic attractors and their corresponding mixing periods do not…

Dynamical Systems · Mathematics 2017-11-20 Gianluigi Del Magno , João Lopes Dias , Pedro Duarte , José Pedro Gaivão

Let E/Q be an elliptic curve with a fixed modular parametrization F : X_0(N) --> E and let P_1,...,P_r be Heegner points on E attached to the rings of integers of distinct quadratic imaginary field k_1,...,k_r. We prove that if the odd…

Number Theory · Mathematics 2011-05-30 Michael Rosen , Joseph H. Silverman

Let OT_d(n) be the smallest integer N such that every N-element point sequence in R^d in general position contains an order-type homogeneous subset of size n, where a set is order-type homogeneous if all (d+1)-tuples from this set have the…

Combinatorics · Mathematics 2014-01-14 Andrew Suk

The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in graphs. This hardness assumption is closely connected to the…

Computational Complexity · Computer Science 2010-11-12 Prasad Raghavendra , David Steurer , Madhur Tulsiani

We consider the best-choice problem for independent (not necessarily iid) observations $X_1, \cdots, X_n$ with the aim of selecting the sample minimum. We show that in this full generality the monotone case of optimal stopping holds and the…

Probability · Mathematics 2021-10-13 Alexander Gnedin , Patryk Kozieł , Małgorzata Sulkowska