We consider the One-Sided Matching problem, where n agents have preferences over items, and these are induced by underlying cardinal valuation functions. The goal is to match every agent a single item so as maximize social welfare. Most of related literature, however, assumes that values not priori known, only access ordinal items provided. Consequently, this incomplete information leads loss e...

We study the Betti numbers of binomial edge ideal associated to some classes of graphs with large Castelnuovo-Mumford regularity. As an application we give several lower bounds of the Castelnuovo-Mumford regularity of arbitrary graphs depending on induced subgraphs.

We investigate the following generalisation of the ‘multiplication table problem’ of Erdős: given a bipartite graph with m edges, how large is the set of sizes of its induced subgraphs? Erdős’s problem, posed in 1955, of estimating the number of distinct products ab with a, b ≤ n is precisely the problem under consideration when the graph in question is the complete bipartite graph Kn,n. In thi...

this paper presents the application of the matching pursuit method to model synchronous generator. this method is useful for online analysis. in the proposed method, the field voltage is considered as input signal, while the terminal voltage and active power of the generator are output signals. usually, the difference equation with a second degree polynomial structure is used to estimate the co...

In this paper, we discuss the induced saturation number. It is a nice generalization of the saturation number that will allow us to consider induced subgraphs. We define the induced saturation number, indsat(n,H), to be the fewest number of gray edges in a trigraph T such that H does not appear in any realization of T , but if a black or white edge of T is flipped to gray then there exists a re...

in this paper, by using a new approach on distance between two fuzzy numbers, we construct a new ranking system for fuzzy number which is very realistic and also matching our intuition as the crisp ranking system on r.