English
Related papers

Related papers: Non-extendability of semilattice-valued measures o…

200 papers

Let $P \subset \mathbb R^2$ be a point set with cardinality $N$. We give an improved bound for the number of dot products determined by $P$, proving that, \[ |\{ p \cdot q :p,q \in P \}| \gg N^{2/3+c}. \] A crucial ingredient in the proof…

Combinatorics · Mathematics 2021-10-01 Brandon Hanson , Oliver Roche-Newton , Steven Senger

Fourier series in orthogonal polynomials with respect to a measure $\nu$ on $[-1,1]$ are studied when $\nu$ is a linear combination of a generalized Jacobi weight and finitely many Dirac deltas in $[-1,1]$. We prove some weighted norm…

Classical Analysis and ODEs · Mathematics 2010-10-12 José J. Guadalupe , Mario Pérez , Francisco J. Ruiz , Juan Luis Varona

The classification of lattice equations that are integrable in the sense of higher-dimensional consistency is extended by allowing directed edges. We find two cases that are not transformable via the 'admissible transformations' to the…

Exactly Solvable and Integrable Systems · Physics 2009-11-13 Chris M. Field

Given a c\`adl\`ag process $X$ on a filtered measurable space, we construct a version of its semimartingale characteristics which is measurable with respect to the underlying probability law. More precisely, let $\mathfrak{P}_{sem}$ be the…

Probability · Mathematics 2014-07-08 Ariel Neufeld , Marcel Nutz

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Rings and Algebras · Mathematics 2013-04-02 G. Grätzer , E. T. Schmidt

Let $\calM=\Gamma\bs \calH^{(n)}$, where $\calH^{(n)}$ is a product of $n+1$ hyperbolic planes and $\Gamma\subset\PSL(2,\bbR)^{n+1}$ is an irreducible cocompact lattice. We consider closed geodesics on $\calM$ that propagate locally only in…

Number Theory · Mathematics 2010-08-31 Dubi Kelmer

The collection CL(T) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f from T to CL(T)…

Combinatorics · Mathematics 2016-11-25 Dwight Duffus , Claude Laflamme , Maurice Pouzet , Robert Woodrow

We characterize numerical semigroups for which the poset of its ideal class monoid is a lattice, and study the irreducible elements of such a lattice with respect to union, intersection, infimum and supremum.

Commutative Algebra · Mathematics 2024-12-11 S. Bonzio , P. A. García-Sánchez

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…

Rings and Algebras · Mathematics 2021-04-29 G. Grätzer , H. Lakser

We show that any metacompact Moore space is monotonically metacompact and use that result to characterize monotone metacompactness in certain generalized ordered (GO)spaces. We show, for example, that a generalized ordered space with a…

General Topology · Mathematics 2011-08-29 Harold R. Bennett , Klaas Pieter Hart , David J. Lutzer

Consider piecewise linear Lorenz maps on $[0, 1]$ of the following form \[ f_{a,b,c}(x)= {ll} ax+1-ac & x \in [0, c) b(x-c) & x \in (c, 1].\] We prove that $f_{a,b,c}$ admits an absolutely continuous invariant probability measure (acim)…

Dynamical Systems · Mathematics 2010-01-19 Yi Ming Ding , Ai Hua Fan , Jing Hu Yu

Let $A$, $B$, and $S$ be (v,0)-semilattices and let $f: A\to B$ be a (v,0)-embedding. Then the canonical map, $f \otimes \id\_S$, of the tensor product $A \otimes S$ into the tensor product $B \otimes S$ is not necessarily an embedding. The…

General Mathematics · Mathematics 2016-08-16 George Grätzer , Friedrich Wehrung

In general, the tensor product, $A\otimes B$, of the lattices A and B with zero is not a lattice (it is only a join-semilattice with zero). If $A \otimes B$ is a capped tensor product, then $A \otimes B$ is a lattice (the converse is not…

General Mathematics · Mathematics 2016-08-16 George Grätzer , Friedrich Wehrung

We attach to each $\langle 0, \vee \rangle$-semilattice a graph $\boldsymbol{G}_{\boldsymbol{S}}$ whose vertices are join-irreducible elements of $\boldsymbol{S}$ and whose edges correspond to the reflexive dependency relation. We study…

Combinatorics · Mathematics 2017-01-12 Pavel Růžička

Reflexive lattice polytopes play a key role in combinatorics, algebraic geometry, physics, and other areas. One important class of lattice polytopes are lattice simplices defining weighted projective spaces. We investigate the question of…

Combinatorics · Mathematics 2022-11-23 Benjamin Braun , Robert Davis , Derek Hanely , Morgan Lane , Liam Solus

We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…

Rings and Algebras · Mathematics 2010-03-15 Miguel Couceiro , Jean-Luc Marichal

The linear extension diameter of a finite poset P is the maximum distance between a pair of linear extensions of P, where the distance between two linear extensions is the number of pairs of elements of P appearing in different orders in…

Combinatorics · Mathematics 2009-07-13 Stefan Felsner , Mareike Massow

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Rodica Simion

We show that, if $M$ is a subspace lattice with the property that the rank one subspace of its operator algebra is weak* dense, $L$ is a commutative subspace lattice and $P$ is the lattice of all projections on a separable infinite…

Functional Analysis · Mathematics 2021-12-06 S. Papapanayides , I. G. Todorov

Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…

Logic in Computer Science · Computer Science 2015-12-31 Mikhail A. Babin , Sergei O. Kuznetsov