Related papers: Congruences and trajectories in planar semimodular…
In first-passage percolation on the integer lattice, the Shape Theorem provides precise conditions for convergence of the set of sites reachable within a given time from the origin, once rescaled, to a compact and convex limiting shape.…
For first passage percolation (FPP) on integer lattice with i.i.d. passage time distributions, in order to show existence of semi-infinite geodesics along a fixed direction, one requires unproven assumptions on the limiting shape. We…
A structure $\cal S$ is quasi-projective if for every structure $\cal T$, for every homomorphism $f : {\cal S} \rightarrow {\cal T}$ and every epimorphism $j: {\cal S}\rightarrow {\cal T}$ there is an endomorphism $\phi$ of $\cal S$ such…
We derive a path counting formula for two-dimensional lattice path model with filter restrictions in the presence of long steps, source and target points of which are situated near the filters. This solves a problem of finding an explicit…
In this paper, we extend and investigate the properties of the semi-smooth Newton method when applied to a general projection equation in finite dimensional spaces. We first present results concerning Clarke's generalized Jacobian of the…
For many equation-theoretical questions about modular lattices, Hall and Dilworth give a useful construction: Let $L_0$ be a lattice with largest element $u_0$, $L_1$ be a lattice disjoint from $L_0$ with smallest element $v_1$, and $a \in…
We prove a structural result for orientation-preserving actions of finitely generated solvable groups on real intervals, considered up to semi-conjugacy. As applications we obtain new answers to a problem first considered by J. F. Plante,…
We obtain variants of the classical Minkowski Theorem on inhomogeneous approximation where we require moreover that the solutions $p, q$ be coprime integers. We link the subject with density exponents of lattice orbits in the real plane.
A modular semilattice is a semilattice generalization of a modular lattice. We establish a Birkhoff-type representation theorem for modular semilattices, which says that every modular semilattice is isomorphic to the family of ideals in a…
We prove that applying a projective functor to a holonomic simple module over a semi-simple finite dimensional complex Lie algebra produces a module that has an essential semi-simple submodule of finite length. This implies that holonomic…
An outstanding folklore conjecture asserts that, for any prime $p$, up to isomorphism the projective plane $PG(2,\mathbb{F}_p)$ over the field $\mathbb{F}_p := \mathbb{Z}/p\mathbb{Z}$ is the unique projective plane of order $p$. Let $\pi$…
A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commu-tative ring. A main tool for this study is the construction of a correspondence functor associated…
Part B (of a project involving four Parts) is about "bases of lines", a concept introduced by C. Herrmann and the author in the late 80's. Bases of lines attempt to describe a given modular lattice in a geometric way akin to how projective…
We propose graph theoretic equivalents for existence of a finite projective plane. We then develop a new approach and see that the problem of existence of a finite projective plane of order n is linked up with a subset of sharply 2…
This study delves into first-passage percolation on random geometric graphs in the supercritical regime, where the graphs exhibit a unique infinite connected component. We investigate properties such as geodesic paths, moderate deviations,…
In 2009, W. D. Banks and I. E. Shparlinski studied the average densities of primes $p \leq x$ for which the reductions of elliptic curves of small height modulo $p$ satisfy certain arithmetic properties, namely cyclicity and divisibility of…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…
The paper deals with special types of $L$-ordered set, $L$-fuzzy complete lattices, and fuzzy directed complete posets (fuzzy $dcpo$s). First, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an…
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…