English
Related papers

Related papers: Symmetric Iterations with Countable and $<\kappa$-…

200 papers

We introduce the forcing property of descending distributivity. A forcing $\mathbb{P}$ is $\kappa$-descending distributive if for all decreasing sequences $(D_\alpha)_{\alpha<\kappa}$ of open dense sets, $\bigcap_\alpha D_\alpha$ is open…

Logic · Mathematics 2025-06-16 Calliope Ryan-Smith

Let $G$ be a countable branch group of automorphisms of a spherically homogeneous rooted tree. Under some assumption on finitarity of $G$, we construct, for each sequence $\omega\in\{0,1\}^\Bbb N$, an irreducible unitary representation…

Dynamical Systems · Mathematics 2025-03-07 Alexandre I. Danilenko , Artem Dudko

Let $A$ and $C$ be two unital simple C*-algebas with tracial rank zero. Suppose that $C$ is amenable and satisfies the Universal Coefficient Theorem. Denote by ${{KK}}_e(C,A)^{++}$ the set of those $\kappa$ for which…

Operator Algebras · Mathematics 2008-03-10 Huaxin Lin , Zhuang Niu

We introduce a new topological generalization of the $\sigma$-projective hierarchy, not limited to Polish spaces. Earlier attempts have replaced $^{\omega}\omega$ by $^{\kappa}\kappa$, for $\kappa$ regular uncountable, or replaced countable…

Logic · Mathematics 2022-10-13 Iván Ongay-Valverde , Franklin D. Tall

We propose a control design method for linear time-invariant systems that iteratively learns to satisfy unknown polyhedral state constraints. At each iteration of a repetitive task, the method constructs an estimate of the unknown…

Systems and Control · Electrical Eng. & Systems 2023-06-13 Monimoy Bujarbaruah , Charlott Vallon , Francesco Borrelli

The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M…

Logic · Mathematics 2012-05-07 Ioannis Souldatos

This paper contributes to the set-theoretic side of understanding Keisler's order. We consider properties of ultrafilters which affect saturation of unstable theories: the lower cofinality $\lcf(\aleph_0, \de)$ of $\aleph_0$ modulo $\de$,…

Logic · Mathematics 2012-04-09 M. Malliaris , S. Shelah

Here we show that, given a finite homological system $({\cal P},\leq,\{\Delta_u\}_{u\in {\cal P}})$ for a finite-dimensional algebra $\Lambda$ over an algebraically closed field, the category ${\cal F}(\Delta)$ of $\Delta$-filtered modules…

Representation Theory · Mathematics 2026-02-09 Raymundo Bautista Ramos , Jesús Efrén Pérez Terrazas , Leonardo Salmerón Castro

Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list…

Logic · Mathematics 2008-02-03 Saharon Shelah

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem: Suppose $\kappa$ is a singular strong limit cardinal and…

Logic · Mathematics 2016-09-06 Moti Gitik , William Mitchell

Data fusion models based on Coupled Matrix and Tensor Factorizations (CMTF) have been effective tools for joint analysis of data from multiple sources. While the vast majority of CMTF models are based on the strictly multilinear…

Machine Learning · Computer Science 2025-06-17 Carla Schenker , Xiulin Wang , David Horner , Morten A. Rasmussen , Evrim Acar

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Information Theory · Computer Science 2022-03-30 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan

We present a formal framework for proving the correctness of set implementations backed by binary-search-tree (BST) and linked lists, which are often difficult to prove correct using automation. This is because many concurrent set…

Programming Languages · Computer Science 2023-05-16 Uri Abraham , Avi Hayoun

A copula of continuous random variables $X$ and $Y$ is called an \emph{implicit dependence copula} if there exist functions $\alpha$ and $\beta$ such that $\alpha(X) = \beta(Y)$ almost surely, which is equivalent to $C$ being factorizable…

Statistics Theory · Mathematics 2016-06-29 Songkiat Sumetkijakan

Let kappa be a regular uncountable cardinal and lambda >=kappa^+ . The principle of stationary reflection for P_kappa lambda has been successful in settling problems of infinite combinatorics in the case kappa=omega_1. For a greater kappa…

Logic · Mathematics 2007-05-23 Saharon Shelah , Masahiro Shioya

Let L be the manifold of all (unparametrized) oriented lines of R^3. We study the controllability of the control system in L given by the condition that a curve in L describes at each instant, at the infinitesimal level, an helicoid with…

Differential Geometry · Mathematics 2022-08-30 Mateo Anarella , Marcos Salvai

We propose a diagnostic tool for detecting non-trivial symmetry protected topological (SPT) phases protected by a symmetry group $G$ in 2+1 dimensions. Our method is based on directly studying the 1+1-dimensional anomalous edge conformal…

Strongly Correlated Electrons · Physics 2017-09-13 Bo Han , Apoorv Tiwari , Chang-Tse Hsieh , Shinsei Ryu

Bounded policy iteration is an approach to solving infinite-horizon POMDPs that represents policies as stochastic finite-state controllers and iteratively improves a controller by adjusting the parameters of each node using linear…

Artificial Intelligence · Computer Science 2012-06-18 Eric A. Hansen

The restarted primal-dual hybrid gradient method (rPDHG) has recently emerged as an important tool for solving large-scale linear programs (LPs). For LPs with unique optima, we present an iteration bound of…

Optimization and Control · Mathematics 2026-05-19 Zikai Xiong

It is well known that the reachability problem for simply-typed lambda calculus with recursive definitions and finite base-type values (finitary PCF) is decidable. A recent paper by Dal Lago and Ghyselen has shown that the same problem…

Logic in Computer Science · Computer Science 2025-08-21 Ryunosuke Endo , Tachio Terauchi