Related papers: An abundance theorem for generalised pairs

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

We study the joint distribution of the number of occurrences of members of a collection of nonoverlapping motifs in digital data. We deal with finite and countably infinite collections. For infinite collections, the setting requires that we…

Motivated by two Legendre-type formulas for overpartitions, we derive a variety of their companions as Legendre theorems for overpartition pairs. This leads to equalities of subclasses of overpartitions and overpartition pairs.

We prove a general transfer theorem for multivariate random sequences with independent random indexes in the double array limit setting. We also prove its partial inverse providing necessary and sufficient conditions for the convergence of…

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…

We introduce the notion of quasi-log complex analytic spaces and establish various fundamental properties. Moreover, we prove that a semi-log canonical pair naturally has a quasi-log complex analytic space structure. This paper is part of…

Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.

We prove that if A is a finite algebra with a parallelogram term that satisfies the split centralizer condition, then A is dualizable. This yields yet another proof of the dualizability of any finite algebra with a near unanimity term, but…

Datalog$^\neg$ is a central formalism used in a variety of domains ranging from deductive databases and abstract argumentation frameworks to answer set programming. Its model theory is the finite counterpart of the logical semantics…

We show that given any two minimal models of a generalized lc pair, there exist small birational models which are connected by a sequence of symmetric flops. We also present some applications.

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…

We show that the Generalized Vanishing Conjecture $$\forall_{m \ge 1} [\Lam^m f^m = 0] \Longrightarrow \forall_{m \gg 0} [\Lam^m (g f^m) = 0]$$ for a fixed differential operator $\Lam \in k[\partial]$ follows from a special case of it,…

In this paper we show that the set of accumulation points of generalized log canonical thresholds for certain DCC sets comes from the set of generalized log canonical thresholds of dimension $1$ less of the same DCC sets.

Consider the set of all natural numbers that are co-prime to primes less than or equal to a given prime. Then given a consecutive pair of numbers in that set with an arbitrary even gap, we prove there exists an unbounded number of actual…

We prove an equidistribution result for the zeros of polynomials with integer coefficients and simple zeros. Specifically, we show that the normalized zero measures associated with a sequence of such polynomials, having small height…

We establish a general normal subgroup theorem for commensurators of lattices in locally compact groups. While the statement is completely elementary, its proof, which rests on the original strategy of Margulis in the case of higher rank…

We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…

Various characterizations are offered of injectivity of the canonical fundamental group homomorphism for a certain class of inverse limit spaces. One application characterizes the existence of a kind of generalized universal cover.

We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…

With the help of Generalized Estimating Equations, we identify locally D-optimal crossover designs for generalized linear models. We adopt the variance of parameters of interest as the objective function, which is minimized using…