Related papers: Taylor is prime
A prime labeling of a graph with $n$ vertices is a labeling of its vertices with distinct integers from $\{1, 2,\ldots , n\}$ in such a way that the labels of any two adjacent vertices are relatively prime. T. Varkey conjectured that ladder…
Let $G$ be a finitely generated group, and let $\Bbbk{G}$ be its group algebra over a field of characteristic $0$. A Taylor expansion is a certain type of map from $G$ to the degree completion of the associated graded algebra of $\Bbbk{G}$…
We prove that if the prime graphs in a graph class have bounded lettericity, then the entire class has bounded lettericity if and only if it does not contain arbitrary large matchings, co-matchings, or a family of graphs that we call…
While a language assigns a value of either `yes' or `no' to each word, a lattice language assigns an element of a given lattice to each word. An advantage of lattice languages is that joins and meets of languages can be defined as…
This text is devoted to the theory of varieties, which provides an important tool, based in universal algebra, for the classification of regular languages. In the introductory section, we present a number of examples that illustrate and…
Let A be an ample line bundle on a projective toric variety X of dimension n. We show that if l>=n-1+p, then A^l satisfies the property N_p. Applying similar methods, we obtain a combinatorial theorem: For a given lattice polytope P we give…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
In this paper we give a complete classification of totally-reflective, primitive genera in dimension 3 and 4. Our method breaks up into two parts. The first part consists of classifying the square free, totally-reflective, primitive genera…
The goal of this paper is to deepen the study of multiplicative lattices in the sense of Facchini, Finocchiaro and Janelidze. We provide a sort of Prime Ideal Principle that guarantees that maximal implies prime in a variety of cases (among…
Finitary/static semantics in the form of intersection type assignments have become a paradigm for analysing the fine structure of all sorts of lambda-models. The key step is the construction of a filter model isomorphic to a given…
There exist two known canonical types of ultrafilter extensions of first-order models; one comes from modal logic and universal algebra, another one from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as…
In [24], Yassine et al. introduced the notion of 1-absorbing prime ideals in commutative rings with nonzero identity. In this article, we examine the concept of 1-absorbing prime elements in C-lattices. We investigate the C-lattices in…
We characterize conjugacy classes of isometries of odd prime order in unimodular Z-lattices. This is applied to give a complete classification of odd prime order non-symplectic automorphisms of irreducible holomorphic symplectic manifolds…
We initiate the study of positive-tropical generators as positive analogues of the concept of tropical bases. Applying this to the tropicalization of determinantal varieties, we develop criteria for characterizing their positive part. We…
In this paper we study the set of prime ideals in vector lattices and how the properties of the prime ideals structure the vector lattice in question. The different properties that will be considered are firstly, that all or none of the…
Pointwise-supported generalized wavelets are introduced, based on Dirac, doublet and further derivatives of delta. A generalized biorthogonal analysis leads to standard Taylor series and new Dual-Taylor series that may be interpreted as…
We show that $\kgl$-linear cohomology theories over an affine Dedekind scheme $S$ admit a canonical weight filtration on resolvable motives without inverting residual characteristics. Combined with upcoming work of Annala--Hoyois--Iwasa,…
We prove that a triangulated category which is the underlying category of a stable derivator has a filtered enhancement, providing an affirmative answer to a conjecture in [3].
In this paper, we derive an optimal first-order Taylor-like formula. In a seminal paper [14], we introduced a new first-order Taylor-like formula that yields a reduced remainder compared to the classical Taylor's formula. Here, we relax the…
Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…