相关论文: Congruences and trajectories in planar semimodular…

In this paper, we present a simple lattice-theoretic characterization for affine buildings of type A. We introduce a class of modular lattices, called uniform modular lattices, and show that uniform modular lattices and affine buildings of…

The paper proves finite model property and decidability for a family of modal logics. A binary relation $R$ is called pretransitive, if $R^*=\cup_{i\leq m} R^i$ for some $m\geq 0$, where $R^*$ is the transitive reflexive closure of $R$. By…

We characterize the topological non-cancellative cones that are expressible as projective limits of finite powers of $[0,\infty]$. These are also the cones of lower semicontinuous extended-valued traces on AF C*-algebras. Our main result…

We review the notion of (finitary) filter pair as a tool for creating and analyzing logics. A filter pair can be seen as a presentation of a logic, given by presenting its lattice of theories as the image of a lattice homomorphism, with…

We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…

Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…

In this note we analyse the Lie algebras of physical states stemming from lattice constructions on general even, self-dual lattices Gamma^{p,q} with p greater or equal to q. It is known that if the lattice is at most Lorentzian, the…

We describe some combinatorial problems in finite projective planes and indicate how R\'edei's theory of lacunary polynomials can be applied to them.

The goal of this paper is to study approaches to bridge the gap between first-order and second-order type methods for composite convex programs. Our key observations are: i) Many well-known operator splitting methods, such as…

In this paper we study prime, maximal and two--class congruences from the point of view of the relationships between them in various kinds of universal algebras, as well as their direct and inverse images through morphisms. This research…

F. Stenger proposed efficient approximation formulas for derivatives over infinite intervals. These formulas were derived by combining the Sinc approximation with appropriate conformal maps. It has been demonstrated that these formulas can…

Dense forests are discrete subsets of Euclidean space which are uniformly close to all sufficiently long line segments. The degree of density of a dense forest is measured by its visibility function. We show that cut-and-project…

Let $\varepsilon>0$ be a fixed small constant, ${\mathbb F}_p$ be the finite field of $p$ elements for prime $p$. We consider additive and multiplicative problems in ${\mathbb F}_p$ that involve intervals and arbitrary sets. Representative…

Let P and Q be relatively prime integers greater than 1, and f a real valued discretely supported function on a finite dimensional real vector space V. We prove that if f_{P}(x)=f(Px)-f(x) and f_{Q}(x)=f(Qx)-f(x) are both \Lambda-periodic…

We investigate a recent semantics for intermediate (and modal) logics in terms of polyhedra. The main result is a finite axiomatisation of the intermediate logic of the class of all polytopes -- i.e., compact convex polyhedra -- denoted PL.…

We give upper bounds on the number of exceptional radial projections of arbitrary subsets of vector spaces over finite fields. Our bounds do not depend on the dimension of the ambient space. Let $\mathbb{F}_q^d$ be the $d$-dimensional…

We investigate conformal actions of cocompact lattices in higher-rank simple Lie groups on compact pseudo-Riemannian manifolds. Our main result gives a general bound on the real-rank of the lattice, which was already known for the action of…

In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…

For some important families of complete infinite lattices, we study some generalizations of two fundamental notions which are mostly treated for finite lattices. Specifically, for well-separated $\kappa$-lattices, and also for weakly atomic…

We provide new conditions under which the alternating projection sequence converges in norm for the convex feasibility problem where a linear subspace with finite codimension $N\geq 2$ and a lattice cone in a Hilbert space are considered.…