Related papers: An abundance theorem for generalised pairs
We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…
Using theory of props we prove a formality theorem associated with universal quantizations of (strongly homotopy) Lie bialgebras.
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…
A common theme in mathematics is to define generalized solutions to deal with problems that potentially do not have solutions. A classical example is the introduction of least squares solutions via the normal equations associated with a…
We provide two proofs of the compactness theorem for extensions of first-order logic based on team semantics. First, we build upon L\"uck's ultraproduct construction for team semantics and prove a suitable version of {\L}o\'s' Theorem.…
In the context of general rough sets, the act of combining two things to form another is not straightforward. The situation is similar for other theories that concern uncertainty and vagueness. Such acts can be endowed with additional…
We present a short proof, relaying on the divergence theorem, verifying that minimal sets in the plane are trivial.
We prove a common extension of Bang's and Kadets' lemmas for contact pairs, in the spirit of the Colourful Carath\'eodory Theorem. We also formulate a generalized version of the affine plank problem and prove it under special assumptions.…
Given a logarithmic $1$-form on the snc locus of a log canonical surface pair $(X, D)$ over a perfect field of characteristic $p \ge 7$, we show that it extends with at worst logarithmic poles to any resolution of singularities. We also…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
Lattice theoretical generalizations of some classical linear algebra results are formulated. A vector space is replaced by its subspace lattice and a linear map is replaced by the induced lattice map. This map is a complete join…
We study pairs of finitely generated modules over a principal ideal domain and their corresponding matrix representations. We introduce equivalence relations for such pairs and determine invariants and canonical forms.
Let $L$ be any finite distributive lattice and $B$ be any boolean predicate defined on $L$ such that the set of elements satisfying $B$ is a sublattice of $L$. Consider any subset $M$ of $L$ of size $k$ of elements of $L$ that satisfy $B$.…
We generalize the classical K\"onig's and B\"ottcher's Theorems in complex dynamics to certain quasiregular mappings in the plane. Our approach to these results is unified in the sense that it does not depend on the local injectivity, or…
A well-known conjecture of Orlov asks whether the existence of a full exceptional collection implies rationality of the underlying variety. We prove this conjecture for arithmetic toric varieties over general fields. We also investigate a…
We generalize the rationality theorem of the accumulation points of log canonical thresholds which was proved by Hacon, M\textsuperscript{c}Kernan, and Xu. Further, we apply the rationality to the ACC problem on the minimal log…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
We generalize the classical notion of adjoint of a linear operator and the Aron-Schottenloher notion of adjoint of a homogeneous polynomial. The general notion is shown to enjoy several properties enjoyed by the classical ones, nevertheless…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…