On the minimal free resolution of some projective curves

Summary Here we study the minimal free resolution of non linearly normal embedded curves of high degree and the homogeneous ideal of general enough curves (for general k-gonal curves and, in a much under range, for curves with general moduli). Then we consider the surjectivity of the Gaussian maps (or «Wahl maps») for non complete linear systems.     

On the minimal free resolution ofs points in IP3

Here we construct many possible minimal free resolutions ofs points in IP³ with general postulation, and prove a few a priori restrictions for their invariants. Partially supported by M.P.I.     

The minimal free resolution of a Borel ideal

We consider the Eliahou–Kervaire minimal free resolution of a 0-Borel ideal and its applications.     

On the trace of finite sets

For a family $\text{T}$ of subsets of an n-set X we define the trace of it on a subset Y of X by T_$\text{T}$(Y) = {F∩Y:F?$\text{T}$}. We say that (m,n) → (r,s) if for every $\text{T}$ with |$\text{T| ?m}$ we can find a Y?X|Y| = s such that |T_$\text{T}$(Y)| ? r. We give a unified proof for results of Bollobàs, Bondy, and Sauer concerning this arrow function, and we prove a conjecture of Bondy and Lovász saying $\text{(?}\text{n}{}^2\text{4}\text{? + n + 2,n)→ (3,7)}$, which generalizes Turán's theorem on the maximum number of edges in a graph not containing a triangle.     

On finite minimal non-nilpotent groups

A critical group for a class of groups is a minimal non- -group. The critical groups are determined for various classes of finite groups. As a consequence, a classification of the minimal non-nilpotent groups (also called Schmidt groups) is given, together with a complete proof of Gol'fand's theorem on maximal Schmidt groups.

     

On the finite prime spectrum minimal groups

Let G be a finite group. The set of all prime divisors of the order of G is called the prime spectrum of G and is denoted by π(G). A group G is called prime spectrum minimal if π(G) ≠ π(H) for any proper subgroup H of G. We prove that every prime spectrum minimal group all of whose nonabelian composition factors are isomorphic to the groups from the set {PSL ₂(7), PSL ₂(11), PSL ₅(2)} is generated by two conjugate elements. Thus, we extend the corresponding result for finite groups with Hall maximal subgroups. Moreover, we study the normal structure of a finite prime spectrum minimal group with a nonabelian composition factor whose order is divisible by exactly three different primes.     

On the maximum size of minimal definitive quartet sets

In this paper, we investigate a problem concerning quartets; a quartet is a particular kind of tree on four leaves. Loosely speaking, a set of quartets is said to be ‘definitive’ if it completely encapsulates the structure of some larger tree, and ‘minimal’ if it contains no redundant information. Here, we address the question of how large a minimal definitive quartet set on n leaves can be, showing that the maximum size is at least 2n−8 for all n≥4. This is an enjoyable problem to work on, and we present a pretty construction, which employs symmetry.     

On minimal subgroups of finite groups

In this paper, the minimal subgroups of a finite group G are studied. Using the normalizes of Sylow subgroups of G, we obtain some sufficient conditions for G to be p-milpotent and supersolvable, which ae extensions of the related results of Burnside, Ito, Buckley and Asaad.     

On some closed sets in ideal minimal spaces

The purpose of this paper is to introduce ideal minimal spaces and to investigate the relationships between minimal spaces and ideal minimal spaces. We define some closed sets in these spaces to establish their relationships. Basic properties and characterizations related to these sets are given.     

On the generation of circuits and minimal forbidden sets

We present several complexity results related to generation and counting of all circuits of an independence system. Our motivation to study these problems is their relevance in the solution of resource constrained scheduling problems, where an independence system arises as the subsets of jobs that may be scheduled simultaneously. We are interested in the circuits of this system, the so-called minimal forbidden sets, which are minimal subsets of jobs that must not be scheduled simultaneously. As a consequence of the complexity results for general independence systems, we obtain several complexity results in the context of resource constrained scheduling. On that account, we propose and analyze a simple backtracking algorithm that generates all minimal forbidden sets for such problems. The performance of this algorithm, in comparison to a previously suggested divide-and-conquer approach, is evaluated empirically using instances from the project scheduling library PSPLIB.Acknowledgement We appreciate the input of two anonymous referees. Particularly the deep remarks of one of them greatly improved our understanding of several issues; he also suggested the simplified Example 1. We thank Marc Pfetsch and Alexander Grigoriev for several enlightening discussions. Marc Pfetsch also pointed us to the paper [15]. Parts of this work were done while the authors were PhD students at the Technische Universität Berlin, Germany, where Frederik Stork was supported by DFG grant Mo 446/3-3, and Marc Uetz was supported by bmb+f grant 03-MO7TU1-3 and GIF grant I 246-304.02/97.     

On minimal sets and strictly weaker topologies

In [1], [2] Farrag characterized the stirictly weaker principal topologies than any given principal topology on a nonempty set by using the minimal open sets which are defined by Steiner [3]. This paper mainly generalizes this result by using the minimal sets, which are defined in the paper with respect to the given topology τ on a nonempty set.     

On intersecting families of finite sets

Let X = [1, n] be a finite set of cardinality n and let $\text{F}$ be a family of k-subsets of X. Suppose that any two members of $\text{F}$ intersect in at least t elements and for some given positive constant c, every element of X is contained in less than c |$\text{F}$| members of $\text{F}$. How large |$\text{F}$| can be and which are the extremal families were problems posed by Erdös, Rothschild, and Szemerédi. In this paper we answer some of these questions for n > n₀(k, c). One of the results is the following: let $\text{t = 1,}\text{3}\text{7}\text{< c <}\text{1}\text{2}$. Then whenever $\text{F}$ is an extremal family we can find a 7-3 Steiner system $\text{B}$ such that $\text{F}$ consists exactly of those k-subsets of X which contain some member of $\text{B}$.     

On almost periodic orbits and minimal sets

In this short note we solve in the negative the three problems recently posed by Jie-Hua Mai and Wei-Hua Sun regarding the behaviour of almost periodic orbits and minimal sets of dynamical systems whose phase space is not regular.     

On almost periodic orbits and minimal sets

In this short note we solve in the negative the three problems recently posed by Jie-Hua Mai and Wei-Hua Sun regarding the behaviour of almost periodic orbits and minimal sets of dynamical systems whose phase space is not regular.     

On locally finite minimal non-solvable groups

In the present work we consider infinite locally finite minimal non-solvable groups, and give certain characterizations. We also define generalizations of the centralizer to establish a result relevant to infinite locally finite minimal non-solvable groups.