Results 51 to 60 of about 1,180 (130)

A Euclidean Ramsey theorem

open access: yesDiscrete Mathematics, 1993
AbstractIn this note we shall prove a geometric Ramsey theorem. Let T be a triangle with angles 30, 60 and 90 degrees, and with hypotenus of unit length. Then the theorem says that if one three- colors the 3-space, then there is always a copy of T with monochromatic vertices.
openaire   +1 more source

Bayesian radiocarbon modelling for beginners

open access: yesArchaeometry, Volume 67, Issue S1, Page 31-48, June 2025.
Abstract Due to freely available, tailored software, Bayesian statistics is now the dominant paradigm for archaeological chronology construction in the UK and much of Europe and is increasing in popularity in the Americas. Such software provides users with powerful tools for Bayesian inference for chronological models with little need to undertake ...
Caitlin E. Buck, Miguel A. Juárez
wiley   +1 more source

Dual Ramsey Theorem for Trees

open access: yesCombinatorica, 2023
The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the dual Ramsey theorem for trees.
openaire   +2 more sources

Adaptive Maximization of Social Welfare

open access: yesEconometrica, Volume 93, Issue 3, Page 1073-1104, May 2025.
We consider the problem of repeatedly choosing policies to maximize social welfare. Welfare is a weighted sum of private utility and public revenue. Earlier outcomes inform later policies. Utility is not observed, but indirectly inferred. Response functions are learned through experimentation.
Nicolò Cesa‐Bianchi   +2 more
wiley   +1 more source

Pi01 encodability and omniscient reductions

open access: yes, 2016
A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones.
Monin, Benoit, Patey, Ludovic
core   +2 more sources

A multidimensional Ramsey theorem

open access: yesDiscrete Analysis
A multidimensional Ramsey theorem, Discrete Analysis 2024:21, 10 pp. Ramsey's theorem, the founding result of Ramsey theory, states that for every pair of positive integers $r$ and $k$ there exists $n$ such that if the edges of the complete graph $K_n ...
Antonio Girão   +2 more
doaj   +1 more source

Dynamic self‐control preferences and the behavior of the saving rate

open access: yesThe Scandinavian Journal of Economics, Volume 127, Issue 2, Page 293-341, April 2025.
Abstract We characterize the dynamics of the saving rate in an exogenous growth model where consumers exhibit present‐biased preferences. Based on empirical evidence, we assume that consumers are subject to temptation and exhibit a preference for costly self‐control.
Jaime Alonso‐Carrera   +1 more
wiley   +1 more source

A Ramsey Theorem for Indecomposable Matchings [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2011
A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove a Ramsey-like result for indecomposable matchings, showing that every sufficiently long indecomposable matching contains a long indecomposable matching of one of three types: interleavings ...
openaire   +3 more sources

Quantitative expansivity for ergodic Zd$\mathbb {Z}^d$‐actions

open access: yesJournal of the London Mathematical Society, Volume 111, Issue 4, April 2025.
Abstract We study expansiveness properties of positive measure subsets of ergodic Zd$\mathbb {Z}^d$‐actions along two different types of structured subsets of Zd$\mathbb {Z}^d$, namely, cyclic subgroups and images of integer polynomials. We prove quantitative expansiveness properties in both cases, strengthening combinatorial results from two distinct ...
Alexander Fish, Sean Skinner
wiley   +1 more source

Essentially tight bounds for rainbow cycles in proper edge‐colourings

open access: yesProceedings of the London Mathematical Society, Volume 130, Issue 4, April 2025.
Abstract An edge‐coloured graph is said to be rainbow if no colour appears more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decade as they capture the essence of a number of interesting problems in a variety of areas.
Noga Alon   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy