Search Results

Now showing 1 - 10 of 269
Loading...
Thumbnail Image
Item

The Nagata automorphism is shifted linearizable

2008, Maubach, Stephan, Poloni, Pierre-Marie

A polynomial automorphism F is called shifted linearizable if there exists a linear map L such that LF is linearizable. We prove that the Nagata automorphism N:=(X−YΔ−ZΔ2,Y+ZΔ,Z) where Δ=XZ+Y2 is shifted linearizable. More precisely, defining L(a,b,c) as the diagonal linear map having a,b,c on its diagonal, we prove that if ac=b2, then L(a,b,c)N is linearizable if and only if bc≠1. We do this as part of a significantly larger theory: for example, any exponent of a homogeneous locally finite derivation is shifted linearizable. We pose the conjecture that the group generated by the linearizable automorphisms may generate the group of automorphisms, and explain why this is a natural question.

Loading...
Thumbnail Image
Item

On reflection subgroups of finite Coxeter groups

2011, Douglass, J. Matthew, Pfeiffer, Götz, Röhrle, Gerhard

Let W be a finite Coxeter group. We classify the reflection subgroups of W up to conjugacy and give necessary and sufficient conditions for the map that assigns to a reflection subgroup R of W the conjugacy class of its Coxeter elements to be injective, up to conjugacy.

Loading...
Thumbnail Image
Item

There is a unique real tight contact 3-ball

2010, Öztürk, Ferit, Salepciİ, Nermin

We prove that there is a unique real tight contact structure on the 3-ball with convex boundary up to isotopy through real tight contact structures. We also give a partial classification of the real tight solid tori with the real structure being antipodal map along longitudinal and the identity along meridional direction. For the proofs, we use the real versions of contact neighborhood theorems and the invariant convex surface theory in real contact manifolds.

Loading...
Thumbnail Image
Item

On test sets for nonlinear integer maximization

2007, Lee, Jon, Onn, Shmuel, Weismantel, Robert

A finite test set for an integer maximization problem enables us to verify whether a feasible point attains the global maximum. We estabish in the paper several general results that apply to integer maximization problems wthe monlinear objective functions.

Loading...
Thumbnail Image
Item

Heisenberg–Weyl algebra revisited: Combinatorics of words and paths

2009, Blasiak, Pawel, Duchamp, G.H.E., Horzela, Andrzej, Penson, K.A., Solomon, A.I.

The Heisenberg–Weyl algebra, which underlies virtually all physical representations of Quantum Theory, is considered from the combinatorial point of view. We provide a concrete model of the algebra in terms of paths on a lattice with some decomposition rules. We also discuss the rook problem on the associated Ferrers board; this is related to the calculus in the normally ordered basis. From this starting point we explore a combinatorial underpinning of the Heisenberg–Weyl algebra, which offers novel perspectives, methods and applications.

Loading...
Thumbnail Image
Item

Braid equivalences and the L-moves

2011, Lambropoulou, Sofia

In this survey paper we present the L–moves between braids and how they can adapt and serve for establishing and proving braid equivalence theorems for various diagrammatic settings, such as for classical knots, for knots in knot complements, in c.c.o. 3–manifolds and in handlebodies, as well as for virtual knots, for flat virtuals, for welded knots and for singular knots. The L–moves are local and they provide a uniform ground for formulating and proving braid equivalence theorems for any diagrammatic setting where the notion of braid and diagrammatic isotopy is defined, the statements being first geometric and then algebraic.

Loading...
Thumbnail Image
Item

Dominance and transmissions in supertropical valuation theory

2011, Izhakian, Zur, Knebusch, Manfred, Rowen, Louis

This paper is a sequel of [IKR1], where we defined supervaluations on a commutative ring R and studied a dominance relation Φ>=v between supervaluations φ and υ on R, aiming at an enrichment of the algebraic tool box for use in tropical geometry. A supervaluation φ:R→U is a multiplicative map from R to a supertropical semiring U, cf. [IR1], [IR2], [IKR1], with further properties, which mean that φ is a sort of refinement, or covering, of an m-valuation (= monoid valuation) υ:R→M. In the most important case, that R is a ring, m-valuations constitute a mild generalization of valuations in the sense of Bourbaki [B], while φ>=υ means that υ:R→V is a sort of coarsening of the supervaluation φ. If φ(R) generates the semiring U, then φ>=υ if there exists a "transmission" α:U→V with φ=α∘φ. Transmissions are multiplicative maps with further properties, cf. [IKR1, §55]. Every semiring homomorphism α:U→V is a transmission, but there are others which lack additivity, and this causes a major difficulty. In the main body of the paper we study surjective transmissions via equivalence relations on supertropical semirings, often much more complicated than congruences by ideals in usual commutative algebra.

Loading...
Thumbnail Image
Item

Localized endomorphisms of graph algebras

2011, Conti, Roberto, Hong, Jeong Hee, Szyma´nski, Wojciech

Endomorphisms of graph C*-algebras are investigated. A combinatorial ap- proach to analysis of permutative endomorphisms is developed. Then invertibility criteria for localized endomorphisms are given. Furthermore, proper endomor- phisms which restrict to automorphisms of the canonical diagonal MASA are analyzed. The Weyl group and the restricted Weyl group of a graph C*-algebra are introduced and investigated. Criteria of outerness for automorphisms in the restricted Weyl group are found.

Loading...
Thumbnail Image
Item

Nonlinear optimization over a weighted independence system

2008, Lee, Jon, Onn, Shmuel, Weismantel, Robert

We consider the problem of optimizing a nonlinear objective function over a weighted independence system presented by a linear-optimization oracle. We provide a polynomial-time algorithm that determines an r-best solution for nonlinear functions of the total weight of an independent set, where r is a constant that depends on certain Frobenius numbers of the individual weights and is independent of the size of the ground set. In contrast, we show that finding an optimal (0-best) solution requires exponential time even in a very special case of the problem.

Loading...
Thumbnail Image
Item

Quantities that frequency-dependent selection maximizes

2008, Matessi, Carlo, Schneider, Kristan A.

We consider a model of frequency-dependent selection, to which we refer as the Wildcard Model, that accommodates as particular cases a number of diverse models of biologically specific situations. Two very different particular models (Lessard, 1984; Bürger, 2005; Schneider, 2006), subsumed by the Wildcard Model, have been shown in the past to have a Lyapunov functions (LF) under appropriate genetic assumptions. We show that the Wildcard Model: (i) in continuous time is a generalized gradient system for one locus, multiple alleles and for multiple loci, assuming linkage equilibrium, and its potential is a Lyapunov function; (ii) the LF of the particular models are special cases of the Wildcard Model's LF; (iii) the LF of the Wildcard Model can be derived from a LF previously identified for a model of density- and frequency- dependent selection due to Lotka-Volterra competition, with one locus, multiple alleles, multiple species and continuous-time dynamics (Matessi and Jayakar, 1981). We extend the LF with density and frequency dependence to a multilocus, linkage equilibrium dynamics.