中文
相关论文

相关论文: On closed unbounded sets consisting of former regu…

200 篇论文

There is currently a renewed interest in the Bayesian predictive approach to statistics. This paper offers a review on foundational concepts and focuses on predictive modeling, which by directly reasoning on prediction, bypasses inferential…

统计理论 · 数学 2024-11-22 Sandra Fortini , Sonia Petrone

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

组合数学 · 数学 2007-11-07 Jean-Christophe Aval

We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…

离散数学 · 计算机科学 2015-06-15 Bruno Durand , Andrei Romashchenko

We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…

范畴论 · 数学 2026-02-10 Ivan Kuzmin , Chad Nester , Ülo Reimaa , Sam Speight

Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…

最优化与控制 · 数学 2018-11-06 Dmitriy Drusvyatskiy , Adrian S. Lewis

We provide a novel analytical proof of an improved version of [10, Theorem 3.1], showing that the complement of a closed set satisfying the extended exterior sphere condition is nothing but the union of closed balls with lower…

度量几何 · 数学 2025-04-01 Chadi Nour , Jean Takche

It is consistent (relative to ZFC) that the union of max{b,g} many families in the Baire space which are not finitely dominating is not dominating. In particular, it is consistent that for each nonprincipal ultrafilter U, the cofinality of…

逻辑 · 数学 2010-11-02 Heike Mildenberger , Saharon Shelah , Boaz Tsaban

We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, probably not obtainable by forcing. This gives also a new method to get programs…

计算机科学中的逻辑 · 计算机科学 2018-03-20 Jean-Louis Krivine

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

逻辑 · 数学 2019-03-08 Philip Welch

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Arnon Avron , Liron Cohen

We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically…

逻辑 · 数学 2017-06-08 Ayhan Günaydın

Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players…

计算机科学中的逻辑 · 计算机科学 2014-05-01 Dietmar Berwanger , Anup Basil Mathew

Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large…

组合数学 · 数学 2018-08-22 Jeff Kahn , Jinyoung Park

Motivated by problems in insurance, our task is to predict finite upper bounds on a future draw from an unknown distribution $p$ over the set of natural numbers. We can only use past observations generated independently and identically…

统计理论 · 数学 2013-05-02 Narayana Santhanam , Venkat Anantharam

I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…

逻辑 · 数学 2017-02-10 Jan Krajicek

We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respect to the product topology on the tree). Gale and Stewart…

最优化与控制 · 数学 2026-02-17 Dean Kraizberg

Inspired by the work of Pujals and Sambarino on dominated splitting, we present billiards with a modified reflection law which constitute simple examples of dynamical systems with limit sets with dominated splitting and where the dynamics…

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

逻辑 · 数学 2019-02-01 Rob Egrot

Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established

表示论 · 数学 2017-03-06 Stan Onypchuk

One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…

交换代数 · 数学 2017-11-13 Richard Gustavson , Omar León Sánchez