Results 61 to 70 of about 6,585 (262)
Holding out on restructuring negotiations: A legal analysis over Finnish and Swedish legislation
Abstract This article examines how Finnish and Swedish restructuring laws create opportunities for creditors to hold out on restructuring negotiations. Using Anthony Casey's new bargaining theory and the traditional creditors' bargain model as analytical frames, the study argues that holdouts arise when ex ante rights – particularly security interests,
Anssi Kärki
wiley +1 more source
Divisibility of the sums of the power of consecutive integers [PDF]
We study the divisibility of the sums of the odd power of consecutive integers, S(m,k)=1ᵐᵏ+2ᵐᵏ+...+kᵐᵏ and 1ᵏ+2ᵏ+...+nᵏ for odd integers m and k, by using the Girard-Waring identity. Faulhaber's approach for the divisibilities is discussed.
Tian-Xiao He, Peter J.-S. Shiue
doaj +1 more source
Mixed Steiner Triple Systems With Shortest Length
ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley +1 more source
Divisibility in elliptic divisibility sequences
Certain elliptic divisibility sequences are shown to contain only finitely many prime power terms. In certain circumstances, the methods show only finitely many terms have length below a given bound.
Everest, Graham, King, Helen
openaire +2 more sources
Bonnefoi Christian, Zerbib Monique. Division de la division. In: Chimères. Revue des schizoanalyses, N°37, automne 1999. Gilles et Félix sur le fil du rasoir. pp. 69-78.
Bonnefoi, Christian, Zerbib, Monique
openaire +2 more sources
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley +1 more source
On Odd Covers of Cliques and Disjoint Unions
ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan +7 more
wiley +1 more source
Peskine Sixfolds and Debarre–Voisin Fourfolds With Associated Cubic Fourfolds
ABSTRACT We develop the notion of Peskine sixfolds with associated K3 surfaces and cubic fourfolds and work out numerical conditions for when these associations occur. In discriminant 24, the first family for which there is an associated cubic fourfold, we identify the cubic explicitly.
Corey Brooke +3 more
wiley +1 more source
ABSTRACT Patent owners can sell a royalty interest in stages rather than all at once. This paper asks how much to sell now when claim values are uncertain, buyers are costly to reach, and patent expiry limits the time available. A decision model produces sale schedules that adjust to current value, the share retained, and time remaining.
Andreas Peters
wiley +1 more source
Fixing Ill‐Formed UTF‐16 Strings With SIMD Instructions
ABSTRACT Background We must fix ill‐formed UTF‐16 strings, where surrogate pairs are mismatched. Programming languages such as JavaScript provide functions that replace mismatched surrogates with the Unicode replacement character (U + FFFD). Objectives We seek to accelerate the correction of ill‐formed UTF‐16 strings.
Robert Clausecker, Daniel Lemire
wiley +1 more source

