output
19922026
most citedA fast approach for overcomplete sparse decomposition based on smoothed L0 norm

1.1k citations

Showing 2006Show all

48 papers · 1 filter

math.CO2006★ 17 cited

Circular chromatic index of graphs of maximum degree 3

Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari +3

This paper proves that if is a graph (parallel edges allowed) of maximum degree 3, then provided that does not contain or as a subgraph, whe…

math.CO2006

On the size of the minimum critical set of a Latin square

Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian

A critical set in an array is a set of given entries, such that there exists a unique extension of to an Latin square and no proper subset of h…

cs.CC2006

On the Computational Complexity of Defining Sets

Hamed Hatami, Hossein Maserrat

Suppose we have a family of sets. For every , a set is a {\sf defining set} for if is the only element of th…

cs.CG2006★ 8 cited

On the Complexity of the Circular Chromatic Number

Hamed Hatami, Ruzbeh Tusserkani

Circular chromatic number, is a natural generalization of chromatic number. It is known that it is \NP-hard to determine whether or not an arbitrary graph satisfies $χ(G)…

astro-ph2006★ 57 cited

Modified gravity with

Shant Baghram, Marzieh Farhang, Sohrab Rahvar

Here in this work we propose a modified gravity with the action of instead of Einstein-Hilbert action to describe the late time acceleration of the univ…

quant-ph2006★ 27 cited

Quantum Phase Transitions and Matrix Product States in Spin Ladders

M. Asoudeh, V. Karimipour, A. Sadrolashrafi

We investigate quantum phase transitions in ladders of spin 1/2 particles by engineering suitable matrix product states for these ladders. We take into account both discrete and co…