This paper contains a partial result on the Pierce–Birkhoff conjecture on piece-wise polynomial functions defined by a finite collection {f 1 ,. .. , f r } of polynomials. In the nineteen eighties, generalizing the problem from the polynomial ring to an artibtrary ring Σ, J. Madden proved that the Pierce–Birkhoff conjecture for Σ is equivalent to a statement about an arbitrary pair of points α, β ∈ Sper Σ and their separating ideal ; we refer to this statement as the local Pierce-Birkhoff conjecture at α, β. In [8] we introduced a slightly stronger conjecture, also stated for a pair of points α, β ∈ Sper Σ and the separating ideal , called the Connectedness conjecture, about a finite collection of elements {f 1 , . . . , fr} ⊂ Σ. In the pap...
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain com...
We develop a method for establishing the independence of some \Sigma b i (ff)-formulas from S i 2...
Yannakakis ’ Clique versus Independent Set problem (CL − IS) in communication com-plexity asks for t...
This paper contains a partial result on the Pierce–Birkhoff conjecture on piece-wise polynomial func...
International audienceThis paper represents a step in our program towards the proof of the Pierce--B...
Let R be a real closed field. The Pierce–Birkhoff conjecture says that any piecewise polynomial func...
International audienceThis paper is a step in our program for proving the Piece-Birkhoff Conjecture ...
The problem known as ”Pierce-Birkhoff Conjecture ” finds its origin in a paper by G. Birkhoff and R....
AbstractThe so called “Pierce–Birkhoff Conjecture” asserts that a continuous function h on Rn piecew...
AbstractWe propose to give positive answers to the open questions: is R(X,Y) strong S when R(X) is s...
In the last six years, several combinatorics problems have been solved in an unexpected way using hi...
Conjecture 0.1 (Conjecture of Blagovest Sendov (1958))For a complex polynomial of degree two or more...
In the last 6 years, several combinatorics problems have been solved in an unexpected way using high...
Following the proof of the purity conjecture for weakly separated collections, recent years have rev...
Abstract Following the proof of the purity conjecture for weakly separated collection...
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain com...
We develop a method for establishing the independence of some \Sigma b i (ff)-formulas from S i 2...
Yannakakis ’ Clique versus Independent Set problem (CL − IS) in communication com-plexity asks for t...
This paper contains a partial result on the Pierce–Birkhoff conjecture on piece-wise polynomial func...
International audienceThis paper represents a step in our program towards the proof of the Pierce--B...
Let R be a real closed field. The Pierce–Birkhoff conjecture says that any piecewise polynomial func...
International audienceThis paper is a step in our program for proving the Piece-Birkhoff Conjecture ...
The problem known as ”Pierce-Birkhoff Conjecture ” finds its origin in a paper by G. Birkhoff and R....
AbstractThe so called “Pierce–Birkhoff Conjecture” asserts that a continuous function h on Rn piecew...
AbstractWe propose to give positive answers to the open questions: is R(X,Y) strong S when R(X) is s...
In the last six years, several combinatorics problems have been solved in an unexpected way using hi...
Conjecture 0.1 (Conjecture of Blagovest Sendov (1958))For a complex polynomial of degree two or more...
In the last 6 years, several combinatorics problems have been solved in an unexpected way using high...
Following the proof of the purity conjecture for weakly separated collections, recent years have rev...
Abstract Following the proof of the purity conjecture for weakly separated collection...
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain com...
We develop a method for establishing the independence of some \Sigma b i (ff)-formulas from S i 2...
Yannakakis ’ Clique versus Independent Set problem (CL − IS) in communication com-plexity asks for t...