5 Theobald Court, Theobald Street, Elstree, Herts WD6 4RN T: F: E: www.saca.uk.com Big Ben

Source URL: www.saca.uk.com

CONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. We study the computational question whether a given polytope or spectrahedron SA (as given by the posit

Source URL: www.math.uni-frankfurt.de

IMAGINARY PROJECTIONS OF POLYNOMIALS ¨ THORSTEN JORGENS, THORSTEN THEOBALD, AND TIMO DE WOLFF Abstract. We introduce the imaginary projection of a multivariate polynomial f ∈ C[z] as the projection of the variety of f

Source URL: www.math.uni-frankfurt.de

MIXED EHRHART POLYNOMIALS CHRISTIAN HAASE, MARTINA JUHNKE-KUBITZKE, RAMAN SANYAL, AND THORSTEN THEOBALD Abstract. For lattice polytopes P1 , . . . , Pk ⊆ Rd , Bihanintroduced the discrete mixed volume DMV(P1 ,

Source URL: www.math.uni-frankfurt.de

5 Theobald Court, Theobald Street, Elstree, Herts WD6 4RN T: F: E: www.saca.uk.com Big Ben

Source URL: www.saca.uk.com

Większe możliwości integracji systemu Eureca z SAP dzięki technologii Theobald Software GmbH. W listopadzie 2012 Controlling Systems podpisał umowę partnerską z Theobald Software – certyfikowanym przez SAP dosta

Source URL: www.controlling-systems.pl

COMBINATORICS AND GENUS OF TROPICAL INTERSECTIONS AND EHRHART THEORY REINHARD STEFFENS AND THORSTEN THEOBALD Abstract. Let g1 , . . . , gk be tropical polynomials in n variables with Newton polytopes P1 , . . . , Pk . We

Source URL: www.math.uni-frankfurt.de

POSITIVE POLYNOME UND SEMIDEFINITE OPTIMIERUNG CORDIAN RIENER UND THORSTEN THEOBALD Zusammenfassung. Ausgehend von der Frage, wie die Nichtnegativit¨at eines reellen ¨ Polynoms p ∈ R[X1 , . . . , Xn ] entschieden wer

Source URL: www.math.uni-frankfurt.de

BERN Tonforscher aus der Matte Von Simona Benovici. Aktualisiert amrevolutionierte Theobald Böhm mit seinem Griffsystem den Instrumentenbau. Heute tüftelt der Berner Instrumentenbauer Gregor Pfäffli a

Source URL: www.akustik-labor.ch

Mixed Volume Techniques for Embeddings of Laman Graphs Reinhard Steffens∗, Thorsten Theobald† Abstract We use Bernstein’s Theorem [1] to obtain combinatorial bounds for the

Source URL: www.math.uni-frankfurt.de

• Graph theory
• Discrete mathematics
• Laman graph
• Graph
• Topological graph theory