Related papers: On fresh sets in iterations of Prikry type forcing…
We consider several models (including both multidimensional ordinary differential equations (ODEs) and partial differential equations (PDEs), possibly ill-posed), subject to very strong damping and quasi-periodic external forcing. We study…
In many situations, the decision maker observes items in sequence and needs to determine whether or not to retain a particular item immediately after it is observed. Any decision rule creates a set of items that are selected. We consider…
Hilary Putnam once suggested that "the actual existence of sets as 'intangible objects' suffers... from a generalization of a problem first pointed out by Paul Benacerraf... are sets a kind of function or are functions a sort of set?"…
In this paper we study the existence of continuous solutions and their constructions for a second order iterative functional equation, which involves iterate of the unknown function and a nonlinear term. Imposing Lipschitz conditions to…
In this paper we investigate iteration of maps on lattices and the corresponding polynomial-like iterative equation. Since a lattice need not have a metric space structure, neither the Schauder fixed point theorem nor the Banach fixed point…
Using a structure theorem from [FG2010] we prove a version of multiple recurrence for sets of positive measure in a general stationary dynamical system.
We study the Mathias--Prikry and the Laver type forcings associated with filters and coideals. We isolate a crucial combinatorial property of Mathias reals, and prove that Mathias--Prikry forcings with summable ideals are all mutually…
Several models of neutrino masses predict the existence of neutral heavy leptons. Here, we review current constraints on heavy neutrinos and apply a new formalism separating new physics from Standard Model. We discuss also the indirect…
Kopczy\'{n}ski (ICALP 2006) conjectured that prefix-independent half-positional winning conditions are closed under finite unions. We refute this conjecture over finite arenas. For that, we introduce a new class of prefix-independent…
Final states with four tops appear in various extensions of the Standard Model. Alas, top reconstruction faces combinatorial issues as they show up as large multiplicity events. In this paper, we present a new procedure to determine whether…
We classify newforms with rational Fourier coefficients and complex multiplication for fixed weight up to twisting. Under the extended Riemann hypothesis for odd real Dirichlet characters, these newforms are finite in number. We produce…
We investigate indeterminate points in discrete integrable system. They appear in singularity confinement phenomenon naturally. We develop a method to analyse indeterminate points of dynamical maps and using this method we clarify behaviour…
We show that in the category of preordered sets, there is a natural notion of pretorsion theory, in which the partially ordered sets are the torsion-free objects and the sets endowed with an equivalence relation are the torsion objects.…
In this paper, the existence of perfect and quasi-perfect splitter sets in finite abelian groups is studied, motivated by their application in coding theory for flash memory storage. For perfect splitter sets we view them as splittings of…
We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…
A recently proposed integral representation for permanents is rederived using only elementary combinatorics. For this proof the assumption that the matrix, for which the permanent is calculated, has an inverse is not necessary.
A proof is given that hard-scattering factorization is valid for deep-inelastic processes which are diffractive or which have some other condition imposed on the final state in the target fragmentation region.
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
This dissertation introduces executable refinement types, which refine structural types by semi-decidable predicates, and establishes their metatheory and accompanying implementation techniques. These results are useful for undecidable type…
While compactness is an essential assumption for many results in dynamical systems theory, for many applications the state space is only locally compact. Here we provide a general theory for compactifying such systems, i.e. embedding them…