skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Chang’s Conjecture with $$\square _{\omega _1, 2}$$ from an $$\omega _1$$-Erdős cardinal
Award ID(s):
1764029
PAR ID:
10281991
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Archive for Mathematical Logic
Volume:
59
Issue:
7-8
ISSN:
0933-5846
Page Range / eLocation ID:
893 to 904
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    Abstract In light of recent experimental results, we revisit the dispersive analysis of the $$\omega \rightarrow 3\pi $$ ω → 3 π decay amplitude and of the $$\omega \pi ^0$$ ω π 0 transition form factor. Within the framework of the Khuri–Treiman equations, we show that the $$\omega \rightarrow 3\pi $$ ω → 3 π Dalitz-plot parameters obtained with a once-subtracted amplitude are in agreement with the latest experimental determination by BESIII. Furthermore, we show that at low energies the $$\omega \pi ^0$$ ω π 0 transition form factor obtained from our determination of the $$\omega \rightarrow 3\pi $$ ω → 3 π amplitude is consistent with the data from MAMI and NA60 experiments. 
    more » « less
  2. Regular decision processes (RDPs) are a subclass of non- Markovian decision processes where the transition and reward functions are guarded by some regular property of the past (a lookback). While RDPs enable intuitive and succinct rep- resentation of non-Markovian decision processes, their ex- pressive power coincides with finite-state Markov decision processes (MDPs). We introduce omega-regular decision pro- cesses (ODPs) where the non-Markovian aspect of the transi- tion and reward functions are extended to an ω-regular looka- head over the system evolution. Semantically, these looka- heads can be considered as promises made by the decision maker or the learning agent about her future behavior. In par- ticular, we assume that if the promised lookaheads are not fulfilled, then the decision maker receives a payoff of ⊥ (the least desirable payoff), overriding any rewards collected by the decision maker. We enable optimization and learning for ODPs under the discounted-reward objective by reducing them to lexicographic optimization and learning over finite MDPs. We present experimental results demonstrating the effectiveness of the proposed reduction. 
    more » « less
  3. Reinforcement learning (RL) is a powerful approach for training agents to perform tasks, but designing an appropriate re- ward mechanism is critical to its success. However, in many cases, the complexity of the learning objectives goes beyond the capabili- ties of the Markovian assumption, necessitating a more sophisticated reward mechanism. Reward machines and ω-regular languages are two formalisms used to express non-Markovian rewards for quantita- tive and qualitative objectives, respectively. This paper introduces ω- regular reward machines, which integrate reward machines with ω- regular languages to enable an expressive and effective reward mech- anism for RL. We present a model-free RL algorithm to compute ε-optimal strategies against ω-regular reward machines and evaluate the effectiveness of the proposed algorithm through experiments. 
    more » « less
  4. We introduce a new iterative amalgamated free product construction of II factors, and use it to construct a separable II factor which does not have property Gamma and is not elementarily equivalent to the free group factor $$L(F_n)$$, for any $$n\geq 2$$. This provides the first explicit example of two non-elementarily equivalent $$II_1$$ factors without property Gamma. Moreover, our construction also provides the first explicit example of a $$II_1$$ factor without property Gamma that is also not elementarily equivalent to any ultraproduct of matrix algebras. Our proofs use a blend of techniques from Voiculescu’s free entropy theory and Popa’s deformation/rigidity theory. 
    more » « less
  5. null (Ed.)