Related papers: A polygonal presentation of $Pic(\overline{\mathfr…
In this note, we mainly consider the extended Weyl algebra of two generators (u,v), that is, the algebra generated by u,v with the fundamental commutation relation. Weyl algebra is realized on the space of polynomials of u and v by defining…
According to a result of Arkin~\etal~(2016), given $n$ point pairs in the plane, there exists a simple polygonal cycle that separates the two points in each pair to different sides; moreover, a $O(\sqrt{n})$-factor approximation with…
The main object of this work is the top-dimensional Laplacian operator of a simplicial complex $K$. We study its spectral limiting behavior under a given non-trivial subdivision procedure $\text{div}$. It will be shown that in case…
Kernelization studies polynomial-time preprocessing algorithms. Over the last 20 years, the most celebrated positive results of the field have been linear kernels for classical NP-hard graph problems on sparse graph classes. In this paper,…
Let $G$ be a simple connected graph with order $ n(G)$, local metric dimension $ {\rm dim}_l(G)$, local adjacency metric dimension $ {\rm dim}_{A,l}(G)$, and clique number $ \omega(G)$, where $G\not\cong K_{n(G)}$ and $\omega(G)\geq3$. It…
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores.
In this paper, solution space organization of minimum vertex-cover problem is deeply investigated using the K\"{o}nig-Eg\'{e}rvary (KE) graph and theorem, in which a hierarchical decomposition mechanism named KE-layer structure of general…
Doran, Jensen and Giansiracusa showed a bijection between homogeneous elements in the Cox ring of $\overline{M}_{0,n}$ not divisible by any exceptional divisor section, and weighted pure-dimensional simplicial complexes satisfying a…
Explicit expressions for the generators of the quantum superalgebra $U_q[gl(n/m)]$ acting on a class of irreducible representations are given. The class under consideration consists of all essentially typical representations: for these a…
This is an introduction to small divisors problems. The material treated in this book was brought together for a PhD course I tought at the University of Pisa in the spring of 1999. Here is a Table of Contents: Part I One Dimensional Small…
Partitioning a graph using graph separators, and particularly clique separators, are well-known techniques to decompose a graph into smaller units which can be treated independently. It was previously known that the treewidth was bounded…
This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $\Gamma(G,\mathbb{1})$ with unit lengths. We show that $\text{dgon}(\Gamma(G,\mathbb{1}))$ is equal to the minimal…
The edge metric dimension problem was recently introduced, which initiated the study of its mathematical properties. The theoretical properties of the edge metric representations and the edge metric dimension of generalized Petersen graphs…
An ordered biclique partition of the complete graph $K_n$ on $n$ vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of $K_n$ is covered by at least one and at most two bicliques in the…
We study lowest-weight irreducible representations of rational Cherednik algebras attached to the complex reflection groups G(m,r,n) in characteristic p. Our approach is mostly from the perspective of commutative algebra. By studying the…
Given a graph $G = (V, E)$ and an integer $k$, we study $k$-Vertex Seperator (resp. $k$-Edge Separator), where the goal is to remove the minimum number of vertices (resp. edges) such that each connected component in the resulting graph has…
Let $\pi$ be a set partition of $[n]=\{1,2,...,n\}$. The standard representation of $\pi$ is the graph on the vertex set $[n]$ whose edges are the pairs $(i,j)$ of integers with $i<j$ in the same block which does not contain any integer…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
In this paper we give an explicit presentation of the centre of the restricted rational Cherednik algebra $\overline{H}_c(S_n\wr\mathbb{Z}/\ell\mathbb{Z})$ for a particular choice of parameter $c$. More precisely, we describe the centre of…
Le n be any positive integer. A hyperbinary expansion of n is are presentation of n as sum of powers of 2, each power being used at most twice. In this paper we study some properties of a suitable edge-coloured and vertex-weighted oriented…