English
Related papers

Related papers: Preserving Dependent Choice

200 papers

We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…

Classical Analysis and ODEs · Mathematics 2010-10-27 Neil Lyall , Akos Magyar

This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…

Logic in Computer Science · Computer Science 2022-04-06 Aliaume Lopez

We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…

Logic · Mathematics 2013-09-27 Benno van den Berg , Ieke Moerdijk

The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack…

Quantum Algebra · Mathematics 2010-01-20 W. Baratta

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

Combinatorics · Mathematics 2017-03-14 Greg Kuperberg , Shachar Lovett , Ron Peled

A general theorem on conservation laws for arbitrary difference equations is proved. The theorem is based on an introduction of an adjoint system related with a given difference system, and it does not require the existence of a difference…

Mathematical Physics · Physics 2019-07-08 Linyu Peng

We introduce a new natural notion of convergence for permutations at any specified scale, in terms of the density of patterns of restricted width. In this setting we prove that limits may be chosen independently at a countably infinite…

Combinatorics · Mathematics 2021-10-20 David Bevan

We propose a generalization of the classical stable marriage problem. In our model, the preferences on one side of the partition are given in terms of arbitrary binary relations, which need not be transitive nor acyclic. This generalization…

Computer Science and Game Theory · Computer Science 2014-07-28 Linda Farczadi , Konstantinos Georgiou , Jochen Könemann

Coherent sets of desirable gamble sets is used as a model for representing an agents opinions and choice preferences under uncertainty. In this paper we provide some results about the axioms required for coherence and the natural extension…

Artificial Intelligence · Computer Science 2024-05-17 Catrin Campbell-Moore

We prove some symmetric $q$-congruences.

Number Theory · Mathematics 2016-01-18 He-Xia Ni , Hao Pan

The Taylor expansion is a widely used and powerful tool in all branches of Mathematics, both pure and applied. In Probability and Mathematical Statistics, however, a stronger version of Taylor's classical theorem is often needed, but only…

Other Statistics · Statistics 2023-05-09 Gianluca Viggiano

We consider variants on the classical Berz sublinearity theorem, using only DC, the Axiom of Dependent Choices, rather than AC, the Axiom of Choice which Berz used. We consider thinned versions, in which conditions are imposed on only part…

Classical Analysis and ODEs · Mathematics 2017-12-15 N. H. Bingham , A. J. Ostaszewski

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…

Logic in Computer Science · Computer Science 2021-03-30 Alexandru Baltag , Johan van Benthem

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

Logic · Mathematics 2019-01-29 Saharon Shelah

We build on the stability-preserving school choice model introduced and studied recently in [MV18]. We settle several of their open problems and we define and solve a couple of new ones.

Computer Science and Game Theory · Computer Science 2019-07-02 Karthik Gajulapalli , James A. Liu , Vijay V. Vazirani

This paper investigates logical consequence defined in terms of probability distributions, for a classical propositional language using a standard notion of probability. We examine three distinct probabilistic consequence notions, which we…

Logic · Mathematics 2025-07-04 Paul Égré , Ellie Ripley

We prove that measure-preserving symmetries of an $n$-dimensional differential system preserve its divergence and the divergence derivatives along the solutions. Also, we prove that measure-preserving reversibilities preserve odd-order…

Dynamical Systems · Mathematics 2018-02-06 Marco Sabatini

Doob's theorem provides guarantees of consistent estimation and posterior consistency under very general conditions. Despite the limitation that it only guarantees consistency on a set with prior probability 1, for many models arising in…

Statistics Theory · Mathematics 2018-01-11 Jeffrey W. Miller

We prove that the derived direct image of the constant sheaf with field coefficients under any proper map with smooth source contains a canonical summand. This summand, which we call the geometric extension, only depends on the generic…

Representation Theory · Mathematics 2023-09-22 Chris Hone , Geordie Williamson

Dependence on the parameter is continuous when perturbations of the parameter preserves strict preference for one alternative over another. We characterise this property via a utility function over alternatives that depends continuously on…

Computer Science and Game Theory · Computer Science 2019-04-01 Patrick H. O'Callaghan
‹ Prev 1 4 5 6 7 8 10 Next ›