Search results for "Divisor"

Elementarteiler von Inzidenzmatrizen symmetrischer Blockpläne

1986

By a study of the integral code generated by the rows of the incidence matrix and its extention the following results are obtained: Let d 1,...,d V(d 1|d 2,d 2|d 3...) be the elementary divisors of the incidence matrix of a symmetric (v,n+λ, λ) design. Then d v=(n+λ)n/g.c.d. (n, λ). Moreover, if p is a prime such that p|n, p∤λ and if x p denotes the p-part of x, then (d idv+2−i) p =n p for 2≤i≤v. For projective planes it can be shown that d 1=···=d 3n−2=1, hence $$d_{n^2 - 2n{\text{ }} + {\text{ }}5} {\text{ }} = \cdots = d_{n^2 + n} = n$$ and $$d_{n^2 - n{\text{ }} + {\text{ }}1} = (n + 1)n$$ . The paper also contains some results about elementary divisors of incidence matrices G satisfyin…

On the divisor class group of double solids

1999

For a double solid V→ℙ3> branched over a surface B⊂ℙ3(ℂ) with only ordinary nodes as singularities, we give a set of generators of the divisor class group \(\) in terms of contact surfaces of B with only superisolated singularities in the nodes of B. As an application we give a condition when H* (˜V , ℤ) has no 2-torsion. All possible cases are listed if B is a quartic. Furthermore we give a new lower bound for the dimension of the code of B.

Note on sums containing small divisors

1976

A Learning-Automata Based Solution for Non-equal Partitioning: Partitions with Common GCD Sizes

2021

The Object Migration Automata (OMA) has been used as a powerful tool to resolve real-life partitioning problems in random Environments. The virgin OMA has also been enhanced by incorporating the latest strategies in Learning Automata (LA), namely the Pursuit and Transitivity phenomena. However, the single major handicap that it possesses is the fact that the number of objects in each partition must be equal. Obviously, one does not always encounter problems with equally-sized groups (When the true underlying problem has non-equally-sized groups, the OMA reports the best equally-sized solution as the recommended partition.). This paper is the pioneering attempt to relax this constraint. It p…

Singular systems in dimension 3: Cuspidal case and tangent elliptic flat case

2007

We study two singular systems in R3. The first one is affine in control and we achieve weighted blowings-up to prove that singular trajectories exist and that they are not locally time optimal. The second one is linear in control. The characteristic vector field in sub-Riemannian geometry is generically singular at isolated points in dimension 3. We define a case with symmetries, which we call flat, and we parametrize the sub-Riemannian sphere. This sphere is subanalytic.

Milnor Number Equals Tjurina Number for Functions on Space Curves

2001

The equality of the Milnor number and Tjurina number for functions on space curve singularities, as conjectured recently by V. Goryunov, is proved. As a consequence, the discriminant in such a situation is a free divisor.

On multiples of divisors associated to Veronese embeddings with defective secant variety

2009

In this note we consider multiples aD, where D is a divisor of the blow-up of P^n along points in general position which appears in the Alexander and Hirschowitz list of Veronese embeddings having defective secant varieties. In particular we show that there is such a D with h^1(X,D) > 0 and h^1(X,2D) = 0.

Object Migration Automata for Non-equal Partitioning Problems with Known Partition Sizes

2021

Part 4: Automated Machine Learning; International audience; Solving partitioning problems in random environments is a classic and challenging task, and has numerous applications. The existing Object Migration Automaton (OMA) and its proposed enhancements, which include the Pursuit and Transitivity phenomena, can solve problems with equi-sized partitions. Currently, these solutions also include one where the partition sizes possess a Greatest Common Divisor (GCD). In this paper, we propose an OMA-based solution that can solve problems with both equally and non-equally-sized groups, without restrictions on their sizes. More specifically, our proposed approach, referred to as the Partition Siz…

On the number of different prime divisors of element orders

2005

We prove that the number of different prime divisors of the order of a finite group is bounded by a polynomial function of the maximum of the number of different prime divisors of the element orders. This improves a result of J. Zhang.

Global 1-Forms and Vector Fields

2014

In this chapter we recall some fundamental facts concerning holomorphic 1-forms on compact surfaces: Albanese morphism, Castelnuovo–de Franchis Lemma, Bogomolov Lemma. We also discuss the logarithmic case, which is extremely useful in the study of foliations with an invariant curve. Finally we recall the classification of holomorphic vector fields on compact surfaces. All of this is very classical and can be found, for instance, in [2, Chapter IV] and 24, 35].