Related papers: Many-one reducibility with realizability

The concept of breadth has been used in the classification of p-groups and nilpotent Lie algebras. In this paper, we investigate this notion for finite-dimensional solvable Lie algebras. Our main focus is to characterize solvable Lie…

We prove that every arithmetic progression either contains infinitely many Carmichael numbers or none at all. Furthermore, there is a simple criterion for determining which category a given arithmetic progression falls into. In particular,…

We investigate criteria for von-Neumann finiteness and reversibility in some classes of non-associative algebras. We show that all finite-dimensional alternative algebras, as well as all algebras obtained from the real numbers via the…

It is known that several variations of the axiom of determinacy play important roles in the study of reverse mathematics, and the relation between the hierarchy of determinacy and comprehension are revealed by Tanaka, Nemoto, Montalb\'an,…

We consider the problem of multiplicity and uniqueness of radial solutions of a nonlinear elliptic equation of the form \begin{eqnarray*} \begin{gathered} \Delta u +f(u)=0,\quad x\in \mathbb{R}^N, N\geq 2, \lim\limits_{|x|\to\infty}u(x)=0.…

For an arbitrary finite dimensional algebra $\Lambda$, we prove that any wide subcategory of $\mathsf{mod} \Lambda$ satisfying a certain finiteness condition is $\theta$-semistable for some stability condition $\theta$. More generally, we…

We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the…

We investigate infinite sets that witness the failure of certain Ramsey-theoretic statements, such as Ramsey's or (appropriately phrased) Hindman's theorem; such sets may exist if one does not assume the Axiom of Choice. We obtain very…

A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…

This paper from 2012 is the second in a series of three papers. All three papers deal with interpretability logics and related matters. In the first paper a construction method was exposed to obtain models of these logics. Using this…

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

A complex manifold $X$ is \emph{weakly complete} if it admits a continuous plurisubharmonic exhaustion function $\phi$. The minimal kernels $\Sigma_X^k, k \in [0,\infty]$ (the loci where are all $\mathcal{C}^k$ plurisubharmonic exhaustion…

Let $\Sigma_b$ be a compact Riemann surface of genus $b \geq 2$ and let $\mathsf{P}_2(\Sigma_b)=\pi_1(\Sigma_b \times \Sigma_b - \Delta)$ be the corresponding pure braid group on two strands. A finite quotient $\varphi \colon…

This paper considers the computational hardness of computing expected outcomes and deciding almost-sure termination of probabilistic programs. We show that deciding almost-sure termination and deciding whether the expected outcome of a…

An equivalent definition of the Fibonacci numbers is that they are the unique sequence such that every integer can be written uniquely as a sum of non-adjacent terms. We can view this as we have bins of length 1, we can take at most one…

We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved…

We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…

We study the following natural variation on the classical universality problem: given a language $L(M)$ represented by $M$ (e.g., a DFA/RE/NFA/PDA), does there exist an integer $\ell \geq 0$ such that $\Sigma^\ell \subseteq L(M)$? In the…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…