Related papers: Deducibility in the full Lambek calculus with weak…

We demonstrate equivalence between two definitions of lower finite highest weight categories. We also show that, in the presence of a duality, a lower finite highest weight structure on a category is unique. Finally, we give a new proof for…

For a free group $\mathbb{F}$ of finite rank such that $\text{rank}(\mathbb{F})\geq 3$, we prove that the set of weak limits of a conjugacy class in $\mathbb{F}$ under iterates of some hyperbolic $\phi\in\mathsf{Out(\mathbb{F})}$ is equal…

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

In this work, we state a general conjecture on the solvability of optimization problems via algorithms with linear convergence guarantees. We make a first step towards examining its correctness by fully characterizing the problems that are…

We associate with each convex optimization problem posed on some locally convex space with an infinite index set T, and a given non-empty family H formed by finite subsets of T, a suitable Lagrangian-Haar dual problem. We provide reverse…

Let k be an algebraically closed field and let HaG(d) be the open locus inside H(d) (the Hilbert scheme of 0-dimensional length d subschemes of the projective (d-2)-space over k) corresponding to arithmetically Gorenstein subschemes. We…

We prove that the tangent complex of K-theory, in terms of (abelian) deformation problems over a characteristic 0 field k, is cyclic homology (over k). This equivalence is compatible with the $\lambda$-operations. In particular, the…

For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal…

G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…

We generalize the finiteness theorem for the locus of Hodge classes with fixed self-intersection number, due to Cattani, Deligne, and Kaplan, from Hodge classes to self-dual classes. The proof uses the definability of period mappings in the…

Let $k$ be a nonperfect separably closed field. Let $G$ be a connected reductive algebraic group defined over $k$. We study rationality problems for Serre's notion of complete reducibility of subgroups of $G$. In particular, we present the…

The systematization of the purely Lagrangean approach to constrained systems in the form of an algorithm involves the iterative construction of a generalized Hessian matrix W taking a rectangular form. This Hessian will exhibit as many left…

G\"odel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand…

We describe a new method of proving a priori bounds for positive supersolutions and solutions of superlinear elliptic PDE, based on global weak Harnack inequalities and a quantitative Hopf lemma. Novel results based on the method include:…

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…

Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…

It is proved that every normalized weakly null \sq\ has a sub\sq\ which is convexly unconditional. Further, an Hierarchy of summability methods is introduced and with this we give a complete classification of the complexity of weakly null…

Let G be a connected reductive group over a non-archimedean local field. We say that an irreducible depth-zero (complex) G-representation is non-singular if its cuspidal support is non-singular. We establish a Local Langlands Correspondence…