output
20002026
most citedMacroclumping as solution of the discrepancy between Hα and P v mass loss diagnostics for O-type stars

100 citations

Showing 2005Show all

8 papers · 1 filter

math-ph2005★ 3 cited

Geometry of Integrable Billiards and Pencils of Quadrics

Vladimir Dragovic, Milena Radnovic

We study the deep interplay between geometry of quadrics in d-dimensional space and the dynamics of related integrable billiard systems. Various generalizations of Poncelet theorem…

math-ph2005★ 17 cited

Quasi-Chaplygin Systems and Nonholonimic Rigid Body Dynamics

Yuri N. Fedorov, Bozidar Jovanovic

We show that the Suslov nonholonomic rigid body problem can be regarded almost everywhere as a generalized Chaplygin system. Furthermore, this provides a new example of a multidime…

math.CT2005★ 1 cited

Symmetric Self-Adjunctions and Matrices

K. Dosen, Z. Petric

It is shown that the multiplicative monoids of Brauer's centralizer algebras generated out of the basis are isomorphic to monoids of endomorphisms in categories where an endofuncto…

nlin.SI2005★ 18 cited

Foliations of Isonergy Surfaces and Singularities of Curves

Milena Radnovic, Vered Rom-Kedar

It is well known that changes in the Liouville foliations of the isoenergy surfaces of an integrable system imply that the bifurcation set has singularities at the corresponding en…

math.CT2005

Relevant Categories and Partial Functions

K. Dosen, Z. Petric

A relevant category is a symmetric monoidal closed category with a diagonal natural transformation that satisfies some coherence conditions. Every cartesian closed category is a re…

math-ph2005★ 32 cited

Cayley-Type Conditions for Billiards within Quadrics in

Vladimir Dragovic, Milena Radnovic

The notions of reflection from outside, reflection from inside and signature of a billiard trajectory within a quadric are introduced. Cayley-type conditions for periodical traject…

math.CT2005★ 3 cited

Coherence of Proof-Net Categories

K. Dosen, Z. Petric

The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear l…

math.GN2005

Unlinking Number and Unlinking Gap

Slavik Jablan, Radmila Sazdanović

Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical u…