3 citations · 4 across the 9 of their papers we have counts for
10 papers
The Rank of the Cartier operator on Picard Curves
Vahid Nourozi, Farhad Rahmati
For an algebraic curve defined over an algebraically closed field of characteristic , the -number is the dimension of the space of exact ho…
A remark on a result of Huber and Kahn
Somayeh Habibi, Farhad Rahmati
A. Huber and B. Kahn construct a relative slice filtration on the motive M(X) associated to a principal T-bundle X over a smooth scheme Y. As a consequence of their result, one can…
The -number of Certain Hyperelliptic Curves
Vahid Nourozi, Farhad Rahmati, Saeed Tafazolian
In this paper, we compute a formula for the -number of certain hyperelliptic curves given by the equation for infinitely many values of . The same question is st…
Lyubeznik Tables of Ideals of Cycle Graphs
Parvaneh Nadi, Farhad Rahmati, Majid Eghbali
Let R = K[x_1; : : : ; x_n] be a polynomial ring over a field K, and I := I_C_n be an edge ideal of n-cycle graph C_n. In the present paper, we compute the last column of the Lyube…
On the relation between formal grade and depth with a view toward vanishing of Lyubeznik numbers
Kh. Ahmadi-Amoli, E. Banisaeed, M. Eghbali +1
Let $(R,\fm)$ be a local ring and an ideal. The aim of the present paper is twofold. At first we continue the investigation to compare $\fgrade(I,R)$ with $\depth R/I$ and furt…
Approximation Algorithms for the Load Balanced Capacitated Vehicle Routing Problem
Haniyeh Fallah, Farzad Didehvar, Farhad Rahmati
We study the load balanced capacitated vehicle routing problem (LBCVRP): the problem is to design a collection of tours for a fixed fleet of vehicles with capacity Q to distribute…
Shellable and Cohen-Macaulay complete t-partite graphs
Seyyede Masoome Seyyedi, Farhad Rahmati, Mahdis Saeedi
Let G be a simple undirected graph. We find the number of maximal independent sets in complete t-partite graphs. We will show that vertex decomposability and shellability are equiv…
Toricness of Binomial Edge Ideals
Mahdis Saeedi, Farhad Rahmati, Seyyede Masoome Seyyedi
Let G be a finite simple graph. In this paper we will show that the binomial edge ideal of G, JG is toric if and only if each connected component of G is complete and in this case…
Modification of the Elite Ant System in Order to Avoid Local Optimum Points in the Traveling Salesman Problem
Majid Yousefikhoshbakht, Farzad Didehvar, Farhad Rahmati
This article presents a new algorithm which is a modified version of the elite ant system (EAS) algorithm. The new version utilizes an effective criterion for escaping from the loc…
Squarefree vertex cover algebras
Shamila Bayati, Farhad Rahmati
In this paper we introduce squarefree vertex cover algebras. We study the question when these algebras coincide with the ordinary vertex cover algebras and when these algebras are…