output
20022008
most citedDense graphs are antimagic

105 citations

Showing 2003Show all

11 papers · 1 filter

math.CO2003

Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs

Raphael Yuster

We prove that every Eulerian orientation of contains arc-disjoint directed 4-cycles, improving earlier lower bounds. Combined with a prob…

math.CO2003

Finite automata and pattern avoidance in words

Petter Brändén, Toufik Mansour

We say that a word on a totally ordered alphabet avoids the word if there are no subsequences in order-equivalent to . In this paper we suggest a new approach to the…

math.AC2003

The content of a Gaussian polynomial is invertible

K. Alan Loper, Moshe Roitman

Let R be an integral domain and let f(X) be a nonzero polynomial in R[X]. The content of f is the ideal c(f) generated by the coefficients of f. The polynomial f(X) is called Gauss…

quant-ph2003

Robust Polynomials and Quantum Algorithms

Harry Buhrman, Ilan Newman, Hein Roehrig +1

We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We co…

math.QA20035 cited

Cluster algebras and Weil-Petersson forms

Michael Gekhtman, Michael Shapiro, Alek Vainshtein

In our previous paper we have discussed Poisson properties of cluster algebras of geometric type for the case of a nondegenerate matrix of transition exponents. In this paper we co…

cond-mat.mes-hall200321 cited

Conductance oscillations in strongly correlated fractional quantum Hall line junctions

U. Zuelicke, E. Shimshoni

We present a detailed theory of transport through line junctions formed by counterpropagating single-branch fractional-quantum-Hall edge channels having different filling factors.…