Related papers: Diagrams and rectangular extensions of planar semi…
From any directed graph $E$ one can construct the graph inverse semigroup $G(E)$, whose elements, roughly speaking, correspond to paths in $E$. Wang and Luo showed that the congruence lattice $L(G(E))$ of $G(E)$ is upper-semimodular for…
We show that every centrally symmetric bi-Lipschitz embedding of the circle into the plane can be extended to a global bi-Lipschitz map of the plane with linear bounds on the distortion. This answers a question of Daneri and Pratelli in the…
We investigate the extensions of the Hecke algebras of finite (complex) reflection groups by lattices of reflection subgroups that we introduced, for some of them, in our previous work on the Yokonuma-Hecke algebras and their connections…
The purpose of this survey is to provide a gentle introduction to several recent breakthroughs in graph Ramsey theory. In particular, we will outline the proofs (due to various groups of authors) of exponential improvements to the diagonal,…
We introduce a common generalization of the strong Hanani-Tutte theorem and the weak Hanani-Tutte theorem: if a graph $G$ has a drawing $D$ in the plane where every pair of independent edges crosses an even number of times, then $G$ has a…
In this paper we have given a unified graph coloring algorithm for planar graphs. The problems that have been considered in this context respectively, are vertex, edge, total and entire colorings of the planar graphs. The main tool in the…
The precoloring problem of a graph involves assigning colors to some vertices beforehand, and the objective is to determine whether it can be extended to a proper k-coloring of the entire graph. In 1958, Grotzsch proved that every…
In 2010, G\'{a}bor Cz\'{e}dli and E. Tam\'{a}s Schmidt mentioned that the best cover-preserving embedding of a given semimodular lattice is not known yet [A cover-preserving embedding of semimodular lattices into geometric lattices,…
In the Partially Embedded Planarity problem, we are given a graph $G$ together with a topological drawing of a subgraph $H$ of $G$. The task is to decide whether the drawing can be extended to a drawing of the whole graph such that no two…
We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order ideals in distributive lattices. We use the Order Ideal…
Proper graph coloring assigns different colors to adjacent vertices of the graph. Usually, the number of colors is fixed or as small as possible. Consider applications (e.g. variants of scheduling) where colors represent limited resources…
In this paper we postulate an algebraic model to explain how the symmetry of three lepton species plays its role in the Lorentz extension. Inspired by the two-to-one mapping between the group SL (2, C) and the Lorentz group, we design a…
We define a filtration of a standard Whittaker module over a complex semisimple Lie algebra and and establish its fundamental properties. Our filtration specialises to the Jantzen filtration of a Verma module for a certain choice of…
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
In this memoir, we study the even unimodular lattices of rank at most 24, as well as a related collection of automorphic forms of the orthogonal, symplectic and linear groups of small rank. Our guide is the question of determining the…
We study the flow extension of graphs, i.e., pre-assigning a partial flow on the edges incident to a given vertex and aiming to extend to the entire graph. This is closely related to Tutte's $3$-flow conjecture(1972) that every…
A construction described by the current author (2017) uses two linear prototypes to build a compound graph with Ramsey properties inherited from the prototype graphs. The resulting graph is linear; and cyclic if both prototypes are cyclic.…
Extension conjecture states that if a simple module over an artin algebra has nonzero first self-extension group then it has nonzero i-th self-extension group for infinitely many positive integers i. It is shown by recollement of…
We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement $\mathcal{A}$ of $x$-monotone pseudosegments in the plane and a pair of points $a,b$ with distinct $x$-coordinates and not on the same pseudosegment,…