English
Related papers

Related papers: Strictly monotonic multidimensional sequences and …

200 papers

We prove explicit lower bounds for the smallest singular value and upper bounds for the condition number of rectangular, multivariate Vandermonde matrices with scattered nodes on the complex unit circle. Analogously to the Shannon-Nyquist…

Numerical Analysis · Mathematics 2021-03-16 Stefan Kunis , Dominik Nagel , Anna Strotmann

Let I be a monomial ideal of height c in a polynomial ring S over a field k. If I is not generated by a regular sequence, then we show that the sum of the betti numbers of S/I is at least 2^c + 2^{c-1} and characterize when equality holds.…

Commutative Algebra · Mathematics 2017-06-30 Adam Boocher , James Seiner

Let $G$ be a graph and $D_s$ and $D_t$ be two dominating sets of $G$ of size $k$. Does there exist a sequence $\langle D_0 = D_s, D_1, \ldots, D_{\ell-1}, D_\ell = D_t \rangle$ of dominating sets of $G$ such that $D_{i+1}$ can be obtained…

Computational Complexity · Computer Science 2021-05-21 Marthe Bonamy , Paul Dorbec , Paul Ouvrard

We study the subclass of singleton congestion games with identical and increasing cost functions, i.e., each agent tries to utilize from the least crowded resource in her accessible subset of resources. Our main contribution is a novel…

Computer Science and Game Theory · Computer Science 2020-11-04 Bugra Caskurlu , Ozgun Ekici , Fatih Erdem Kizilkaya

We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…

Combinatorics · Mathematics 2020-11-04 Igor Araujo , József Balogh , Yuzhou Wang

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…

Combinatorics · Mathematics 2021-03-05 Ewan Davies , Matthew Jenssen , Will Perkins , Barnaby Roberts

Many interactions result in a socially suboptimal equilibrium, or in a non-equilibrium state, from which arriving at an equilibrium through simple dynamics can be impossible of too long. Aiming to achieve a certain equilibrium, we persuade,…

Computer Science and Game Theory · Computer Science 2023-12-07 Gleb Polevoy , Jonas Schweichhart

The stable marriage and stable roommates problems have been extensively studied due to their high applicability in various real-world scenarios. However, it might happen that no stable solution exists, or stable solutions do not meet…

Computer Science and Game Theory · Computer Science 2022-04-29 Kristóf Bérczi , Gergely Csáji , Tamás Király

Let $\{X_n\}_{n=0}^{\infty}$ be a stationary real-valued time series with unknown distribution. Our goal is to estimate the conditional expectation of $X_{n+1}$ based on the observations $X_i$, $0\le i\le n$ in a strongly consistent way.…

Probability · Mathematics 2008-06-19 G. Morvai , B. Weiss

This is a continuation of the series of notes on the dynamics of quadratic polynomials. We show the following Rigidity Theorem: Any combinatorial class contains at most one quadratic polynomial satisfying the secondary limbs condition with…

Dynamical Systems · Mathematics 2016-09-06 Mikhail Lyubich

We study the expanding properties of random perturbations of regular interval maps satisfying the summability condition of exponent one. Under very general conditions on the interval maps and perturbation types, we prove strong stochastic…

Dynamical Systems · Mathematics 2014-02-26 Weixiao Shen

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

This paper is part of the ongoing effort to study high-dimensional permutations. We prove the analogue to the Erd\H{o}s-Szekeres theorem: For every $k\ge1$, every order-$n$ $k$-dimensional permutation contains a monotone subsequence of…

Combinatorics · Mathematics 2017-10-24 Nathan Linial , Michael Simkin

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

Combinatorics · Mathematics 2026-05-21 Will Sawin

Kusner asked if $n+1$ points is the maximum number of points in $\mathbb{R}^n$ such that the $\ell_p$ distance $(1<p<\infty)$ between any two points is $1$. We present an improvement to the best known upper bound when $p$ is large in terms…

Metric Geometry · Mathematics 2021-11-23 Richard Chen , Feng Gui , Jason Tang , Nathan Xiong

In this article we study the dynamics of one-dimensional relativistic billiards containing particles with positive and negative energy. We study configurations with two identical positive masses and symmetric positions with two massless…

Dynamical Systems · Mathematics 2025-04-02 Alfonso Artigue

In this paper we prove the following result, useful and often needed in the study of the ergodic properties of hard ball systems: In any such system, for any phase point x with a non-singular forward trajectory and infinitely many connected…

Dynamical Systems · Mathematics 2007-05-23 Nandor Simanyi

We consider multiplayer stochastic games in which the payoff of each player is a bounded and Borel-measurable function of the infinite play. By using a generalization of the technique of Martin (1998) and Maitra and Sudderth (1998), we show…

Optimization and Control · Mathematics 2022-08-26 János Flesch , Eilon Solan

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Number Theory · Mathematics 2021-04-26 Peter J. Bradshaw , Brandon Hanson , Misha Rudnev

We solve the following problem of Z. F\"uredi, J. C. Lagarias and F. Morgan [FLM]: Is there an upper bound polynomial in $n$ for the largest cardinality of a set S of unit vectors in an n-dimensional Minkowski space (or Banach space) such…

Metric Geometry · Mathematics 2007-07-23 Konrad J Swanepoel