Displaying similar documents to “Constructive invariant theory for tori”

On classical invariant theory and binary cubics

Gerald W. Schwarz (1987)

Annales de l'institut Fourier

Similarity:

Let G be a reductive complex algebraic group, and let C [ m V ] G denote the algebra of invariant polynomial functions on the direct sum of m copies of the representations space V of G . There is a smallest integer n = n ( V ) such that generators and relations of C [ m V ] G can be obtained from those of C [ n V ] G by polarization and restitution for all m > n . We bound and the degrees of generators and relations of C [ n V ] G , extending results of Vust. We apply our techniques to compute the invariant theory of binary cubics. ...

A Degree Condition Implying Ore-Type Condition for Even [2,b]-Factors in Graphs

Shoichi Tsuchiya, Takamasa Yashima (2017)

Discussiones Mathematicae Graph Theory

Similarity:

For a graph G and even integers b ⩾ a ⩾ 2, a spanning subgraph F of G such that a ⩽ degF (x) ⩽ b and degF (x) is even for all x ∈ V (F) is called an even [a, b]-factor of G. In this paper, we show that a 2-edge-connected graph G of order n has an even [2, b]-factor if [...] max degG (x),degG (y)⩾max 2n2+b,3 max { deg G ( x ) , deg G ( y ) } max 2 n 2 + b , 3 for any nonadjacent vertices x and y of G. Moreover, we show that for b ⩾ 3a and a > 2, there exists an infinite family of 2-edge-connected graphs G of order n with δ(G) ⩾ a...

The rank of the multiplication map for sections of bundles on curves

E. Ballico (2001)

Bollettino dell'Unione Matematica Italiana

Similarity:

Sia X una curva liscia di genere g 2 ed A , B fasci coerenti su X . Sia μ A , B : H 0 X , A H 0 X , B H 0 X , A B l'applicazione di moltiplicazione. Qui si dimostra che μ A , B ha rango massimo se A ω X e B è un fibrato stabile generico su X . Diamo un'interpretazione geometrica dell'eventuale non-surgettività di μ A , B quando A , B sono fibrati in rette generati da sezioni globali e deg A + deg B 3 g - 1 . Studiamo anche il caso dim Coker μ A , B 2 .

The joint distribution of Q -additive functions on polynomials over finite fields

Michael Drmota, Georg Gutenbrunner (2005)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let K be a finite field and Q K [ T ] a polynomial of positive degree. A function f on K [ T ] is called (completely) Q -additive if f ( A + B Q ) = f ( A ) + f ( B ) , where A , B K [ T ] and deg ( A ) < deg ( Q ) . We prove that the values ( f 1 ( A ) , ... , f d ( A ) ) are asymptotically equidistributed on the (finite) image set { ( f 1 ( A ) , ... , f d ( A ) ) : A K [ T ] } if Q j are pairwise coprime and f j : K [ T ] K [ T ] are Q j -additive. Furthermore, it is shown that ( g 1 ( A ) , g 2 ( A ) ) are asymptotically independent and Gaussian if g 1 , g 2 : K [ T ] are Q 1 - resp. Q 2 -additive.

Degree of the fibres of an elliptic fibration

Alexandru Buium (1983)

Annales de l'institut Fourier

Similarity:

Let X B an elliptic fibration with general fibre F . Let n e , n s , n a , n v be the minima of the non-zero intersection numbers ( , F ) where runs successively through the following sets: effective divisors on X , invertible sheaves spanned by global sections, ample divisors and very ample divisors. Let m be the maximum of the multiplicities of the fibres of X B . We prove that n e = n s if and only if n e 2 m and that n a = n v if and only if n a 3 m .

Sharper ABC-based bounds for congruent polynomials

Daniel J. Bernstein (2005)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Agrawal, Kayal, and Saxena recently introduced a new method of proving that an integer is prime. The speed of the Agrawal-Kayal-Saxena method depends on proven lower bounds for the size of the multiplicative semigroup generated by several polynomials modulo another polynomial h . Voloch pointed out an application of the Stothers-Mason ABC theorem in this context: under mild assumptions, distinct polynomials A , B , C of degree at most 1 . 2 deg h - 0 . 2 deg rad A B C cannot all be congruent modulo h . This paper presents two...