Sciweavers

SIAMREV
2010
181views more  SIAMREV 2010»
12 years 11 months ago
A Variational Approach to Copositive Matrices
This work surveys essential properties of the so-called copositive matrices, the study of which is spread over more than fifty-five years. Special emphasis is given to variational ...
Jean-Baptiste Hiriart-Urruty, Alberto Seeger
SLOGICA
2002
81views more  SLOGICA 2002»
13 years 4 months ago
Bicartesian Coherence
A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places...
Kosta Dosen, Zoran Petric
COMBINATORICS
1999
102views more  COMBINATORICS 1999»
13 years 4 months ago
Critical Subgraphs of a Random Graph
We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical. 1...
Michael Molloy, Bruce A. Reed
ITA
2002
105views Communications» more  ITA 2002»
13 years 4 months ago
Polypodic codes
Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are...
Symeon Bozapalidis, Olympia Louscou-Bozapalidou
COMBINATORICS
2000
75views more  COMBINATORICS 2000»
13 years 4 months ago
Franklin's Argument Proves an Identity of Zagier
Recently Zagier proved a remarkable q-series identity. We show that this identity can also be proved by modifying Franklin's classical proof of Euler's pentagonal number...
Robin J. Chapman
MICS
2008
107views more  MICS 2008»
13 years 4 months ago
Automatic Proof of Graph Nonisomorphism
We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machinereadable. We have developed an experimental imp...
Arjeh M. Cohen, Jan Willem Knopper, Scott H. Murra...
ITA
2008
137views Communications» more  ITA 2008»
13 years 4 months ago
Weakly maximal decidable structures
We prove that there exists a structure M whose monadic second order theory is decidable, and such that the elementary theory of every expansion of M by a constant is undecidable. 1...
Alexis Bès, Patrick Cégielski
CSJM
2006
81views more  CSJM 2006»
13 years 4 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
EJC
2010
13 years 4 months ago
A short proof of a theorem of Bang and Koolen
Let a graph be locally disjoint union of three copies of complete graphs Kq-1 and let be cospectral with the Hamming graph H(3, q). Bang and Koolen [Asian-Eur. J. Math. 1 (2008),...
A. Mohammadian, Behruz Tayfeh-Rezaie
CSJM
2008
50views more  CSJM 2008»
13 years 4 months ago
On stability of a Pareto-optimal solution under perturbations of the parameters for a multicriteria combinatorial partition prob
Abstract. We consider a multicriteria variant for the wellknown partition problem. A formula of the stability radius for an efficient solution was obtained. Mathematics Subject Cl...
Vladimir A. Emelichev, Evgeny E. Gurevsky