Related papers: Descending sequences in reflection hierarchies

We offer a mathematical proof of consistency for Peano Arithmetic PA formalizable in PA. This result is compatible with Goedel's Second Incompleteness Theorem since our consistency proof does not rely on the representation of consistency as…

In this paper we continue the study in [Gilton-Levine-Stejskalova] of compactness and incompactness principles at double successors, focusing here on the case of double successors of singulars of countable cofinality. We obtain models which…

This paper introduces an analogue of the Solomon descent algebra for the complex reflection groups of type $G(r,1,n)$. As with the Solomon descent algebra, our algebra has a basis given by sums of `distinguished' coset representatives for…

Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…

We study consistent query answering in relational databases. We consider an expressive class of schema constraints that generalizes both tuple-generating dependencies and equality-generating dependencies. We establish the complexity of…

The minimal models M(p',p) with p' > 2 have a unique (non-trivial) simple current of conformal dimension h = (p' - 2) (p - 2) / 4. The representation theory of the extended algebra defined by this simple current is investigated in detail.…

Using the Kuznetsov formula, we prove several density theorems for exceptional Hecke and Laplacian eigenvalues of Maass cusp forms of weight 0 or 1 for the congruence subgroups $\Gamma_0(q)$, $\Gamma_1(q)$, and $\Gamma(q)$. These improve…

We study Structural Reflection beyond Vop\v{e}nka's Principle, at the level of almost-huge cardinals and higher, up to rank-into-rank embeddings. We identify and classify new large cardinal notions in that region that correspond to some…

In the theory of combinatorial algebras, there is a sequence of embeddings between Kleene's second model, van Oosten's model, and Scott's graph model. We prove that none of these embeddings can be reversed. We also prove nonembedding…

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…

The complexity class $\exists\mathbb R$, standing for the complexity of deciding the existential first order theory of the reals as real closed field in the Turing model, has raised considerable interest in recent years. It is well known…

We consider the following question arising in the theory of differential inclusions: given an elliptic set $\Gamma$ and a Sobolev map $u$ whose gradient lies in the quasiconformal envelope of $\Gamma$ and touches $\Gamma$ on a set of…

Recollements of derived module categories are investigated, using a new technique, ladders of recollements, which are mutation sequences. The position in the ladder is shown to control whether a recollement restricts from unbounded to…

This paper aims to systematically study mystic reflection groups that emerged independently in the paper [Selecta Math. (N.S.) 14 (2009), 325-372, arXiv:0806.0867] by the authors and in the paper [Algebr. Represent. Theory 13 (2010),…

We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…

Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…

We prove a reflection theorem, conjectured by Nakagawa and Ohno, for the number of quartic rings, or pairs of ternary quadratic forms, with a given cubic resolvent. Over $\mathbb{Z}$, our results are unconditional; we also allow the base to…

We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…

The coinvariant algebra $R_n$ is a well-studied $\mathfrak{S}_n$-module that is a graded version of the regular representation of $\mathfrak{S}_n$. Using a straightening algorithm on monomials and the Garsia-Stanton basis, Adin, Brenti, and…