相关论文: Taylor is prime
We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…
A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…
In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information…
It is shown that every Leavitt path algebra L of an arbitrary directed graph E over a field K is an arithmetical ring, that is, the two-sided ideals of L form a distributive lattice. It is also shown that L is a multiplication ring, that…
Let A be a subset of positive relative upper density of P^d, the d-tuples of primes. We prove that A contains an affine copy of any finite set of lattice points E, as long as E is in general position in the sense that it has at most one…
Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…
The main result of this paper is a structural theorem for projective Q-factorial toric varieties X in P^N, covered by lines. We prove that there exists a toric fibration f: X -> Z, locally trivial in the Zariski topology, with fiber a…
We show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thus improving the existing Cayley/Holland-style embedding theorem. We use this to show that the variety of all…
In this paper, the concepts of binomial difference ideals and toric difference varieties are defined and their properties are proved. Two canonical representations for Laurent binomial difference ideals are given using the reduced Groebner…
In this article, we focus on a new perspective of automorphisms of complex 2-tori, reviewing previous works from a lattice-theoretic point of view. In particular, we give a classification of families of symplectic and non-symplectic…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.
We construct representation theory of Lie algebras with filtrations. In this framework a classification of irreducible representations is obtained and spectra of some reducible representations are found.
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…
Distributive skew lattices satisfying $x\wedge (y\vee z)\wedge x = (x\wedge y\wedge x) \vee (x\wedge z\wedge x)$ and its dual are studied, along with the larger class of linearly distributive skew lattices, whose totally preordered…
The notion of $n$-normal residuated lattice, as a class of residuated lattices in which every prime filter contains at most $n$ minimal prime filters, is introduced and studied. Before that, the notion of $\omega$-filter is introduced and…
We give a general criterion for two toric varieties to appear as fibers in a flat family over the projective line. We apply this to show that certain birational transformations mapping a Laurent polynomial to another Laurent polynomial…
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…
We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…