Related papers: Splitting stationary sets from weak forms of Choic…

This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…

Assume ZF (without the Axiom of Choice). Let $j:V_\varepsilon\to V_\delta$ be a non-trivial $\in$-cofinal $\Sigma_1$-elementary embedding, where $\varepsilon,\delta$ are limit ordinals. We prove some restrictions on the constructibility of…

We survey systematic approaches to basis-restricted fragments of propositional logic and modal logics, with an emphasis on how expressive power and computational complexity depend on the allowed operators. The propositional case is…

We consider overdetermined problems related to the fractional capacity. In particular we study $s$-harmonic functions defined in unbounded exterior sets or in bounded annular sets, and having a level set parallel to the boundary. We first…

In this paper, we consider the obstacle problem for the fractional Laplace operator $(-\Delta)^s$ in the Euclidian space $\mathbb{R}^n$ in the case where $1<s<2$. As first observed in \cite{Y}, the problem can be extended to the upper…

Write $\mathbf{A}_\lambda$ for what might be described as the most elementary nontrivial inverse system of abelian groups indexed by the functions from the cardinal $\lambda$ to the set of natural numbers. The question of whether for any…

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

We show that the character spectrum $Sp_\chi(\lambda)$, for a singular cardinal $\lambda$ of countable cofinality, may include any prescribed set of regular cardinals between $\lambda$ and $2^\lambda$.

Let $X$ be a set, $\ka$ be a cardinal number and let $\iH$ be a family of subsets of $X$ which covers each $x\in X$ at least $\ka$ times. What assumptions can ensure that $\iH$ can be decomposed into $\kappa$ many disjoint subcovers? We…

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

Here we have studied the ideas of $ sg_\lambda,s\lambda$ and $ s\beta_\lambda $-closed sets and investigated some of their properties in generalized topological spaces. We have also studied some low separation axioms namely $ s\lambda…

These notes aim to provide a classical approach to solving some conformable differential equations based on prior knowledge of how to solve ordinary differential equations. That is, using the methods of separation of variables, homogeneous…

In this paper, we characterize the possible cofinalities of the least $\lambda$-strongly compact cardinal. We show that, on the one hand, for any regular cardinal, $\delta$, that carries a $\lambda$-complete uniform ultrafilter, it is…

We perform a qualitative analysis of the critical equation associated with a stationary ergodic Hamiltonian through a stochastic version of the metric method, where the notion of closed random stationary set, issued from stochastic…

We consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the…

We extend the definition of the Costas property to functions in the continuum, namely on intervals of the reals or the rationals, and argue that such functions can be used in the same applications as discrete Costas arrays. We construct…

The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…

The study of separating invariants is a recent trend in invariant theory. For a finite group acting linearly on a vector space, a separating set is a set of invariants whose elements separate the orbits of G. In some ways, separating sets…

The global majority problem, often referred to as the Density Classification Task, is a classical benchmark in the context of probing the computational capabilities of automata networks. It poses the simple yet challenging problem of…

We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…