English
Related papers

Related papers: Pseudo-jump inversion and SJT-hard sets

200 papers

We study the class of pseudo BL-algebras whose every maximal filter is normal. We present an equational base for this class and we extend these results for the class of basic pseudo hoops with fixed strong unit.

Rings and Algebras · Mathematics 2014-12-09 Michal Botur , Anatolij Dvurečenskij

This paper considers the inversion of ill-posed linear operators. To regularise the problem the solution is enforced to lie in a non-convex subset. Theoretical properties for the stable inversion are derived and an iterative algorithm akin…

Numerical Analysis · Mathematics 2009-11-30 Thomas Blumensath

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

Logic · Mathematics 2020-11-09 Noam Greenberg , Matthew Harrison-Trainor , Ludovic Patey , Dan Turetsky

The infinite pigeonhole principle for 2-partitions ($\mathsf{RT}^1_2$) asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we study the infinite pigeonhole principle from a…

Logic · Mathematics 2020-09-21 Benoit Monin , Ludovic Patey

The transition from rotational to discontinuous behavior of the return map of the perturbed oscillators-step system, a paradigm model for a perturbation of a pseudo-integrable Hamiltonian impact system, is studied. The form of the return…

Chaotic Dynamics · Physics 2025-09-30 Idan Pazi , Alexandra Zobova , Vered Rom-Kedar

Full jet reconstruction in relativistic heavy ion collisions provides new and unique insights to the physics of parton energy loss. Because of the large underlying event multiplicity in $A+A$ collisions, random and correlated fluctuations…

Nuclear Experiment · Physics 2009-07-22 N. Grau , B. A. Cole , W. G. Holzmann , M. Spousta , P. Steinberg

The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…

Computational Complexity · Computer Science 2023-06-22 Carsten Rösnick-Neugebauer

For a ring $R$, Hilbert's Tenth Problem $HTP(R)$ is the set of polynomial equations over $R$, in several variables, with solutions in $R$. We view $HTP$ as an operator, mapping each set $W$ of prime numbers to $HTP(\mathbb Z[W^{-1}])$,…

Logic · Mathematics 2019-08-20 Ken Kramer , Russell Miller

Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar…

In this paper we attempt to lay the foundations for a theory encompassing some natural extensions of the class of subnormal operators, namely the $n$--subnormal operators and the sub-$n$--normal operators. We discuss inclusion relations…

Functional Analysis · Mathematics 2026-05-12 Raúl E. Curto , Thankarajan Prasad

Replying to three questions posed by N. Shcherbina, we show that a compact psudoconcave set can have the core smaller than itself, that the core of a compact set must be pseudoconcave, and that it can be decomposed into compact…

Complex Variables · Mathematics 2022-11-14 Zbigniew Slodkowski

The set of all subsets of any inverse semigroup forms an involution semiring under set-theoretical union and element-wise multiplication and inversion. We find structural conditions on a finite inverse semigroup guaranteeing that neither…

Group Theory · Mathematics 2024-03-13 Igor Dolinka , Sergey V. Gusev , Mikhail V. Volkov

For one-dimensional Schroedinger operators with complex-valued potentials, we construct pseudomodes corresponding to large pseudoeigenvalues. Our (non-semi-classical) approach results in substantial progress in achieving optimal conditions…

Spectral Theory · Mathematics 2019-05-21 David Krejcirik , Petr Siegl

For a multiplicative cohomology theory E, complex orientations are in bijective correspondence with multiplicative natural transformations to E from complex bordism cohomology MU. If E is represented by a spectrum with a highly structured…

Algebraic Topology · Mathematics 2017-08-09 Michael J. Hopkins , Tyler Lawson

We consider jet-shape observables of the type proposed recently, where the shapes of one or more high-pT jets, produced in a multi-jet event with definite jet multiplicity, may be measured leaving other jets in the event unmeasured. We…

High Energy Physics - Phenomenology · Physics 2015-03-14 Andrea Banfi , Mrinal Dasgupta , Kamel Khelifa-Kerfa , Simone Marzani

Every K-trivial set is computable from an incomplete Martin-L\"of random set, i.e., a Martin-L\"of random set that does not compute 0'.

We prove a variant of the Chance-McDuff conjecture for pseudo-rotations: under certain additional conditions, a closed symplectic manifold which admits a Hamiltonian pseudo-rotation must have deformed quantum product and, in particular,…

Symplectic Geometry · Mathematics 2019-08-08 Erman Cineli , Viktor L. Ginzburg , Basak Z. Gurel

In conventional quantum mechanics, quantum no-deleting and no-cloning theorems indicate that two different and nonorthogonal states cannot be perfectly and deterministically deleted and cloned, respectively. Here, we investigate the quantum…

Quantum Physics · Physics 2022-04-12 Yucheng Chen , Ming Gong , Peng Xue , Haidong Yuan , Chengjie Zhang

Inversion of operators is a fundamental concept in data processing. Inversion of linear operators is well studied, supported by established theory. When an inverse either does not exist or is not unique, generalized inverses are used. Most…

Statistics Theory · Mathematics 2024-04-02 Eyal Gofer , Guy Gilboa

Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan initiated the search for complexity-theoretic analogs of Rice's Theorem. In particular, they proved that…

Computational Complexity · Computer Science 2007-05-23 Lane A. Hemaspaandra , Joerg Rothe