Results 51 to 60 of about 4,787 (264)
Chemistry – A European Journal, EarlyView.This study introduces PROSPECT, a 2D solid‐state NMR method that correlates MHz‐wide, low‐γ anisotropic powder patterns. PROSPECT operates by progressively depleting a shared 1H dipolar‐order reservoir via two independently stepped cross‐polarizing offsets, yielding homonuclear and heteronuclear correlations without requiring direct transfers or even ...
Rihards Aleksis, Lucio Frydman
wiley +1 more source
DIVISIBILITY TESTS FOR SMARANDACHE SEMIGROUPS [PDF]
, 2002 Two Divisibility Tests for Smarandache semigroups are given. Further, the notion of divisibility of elements in a semigroup is applied to characterize the Smarandache semigroups.
Rao, Chandra Sekhar
core +1 more source
Divisibility of the sums of the power of consecutive integers [PDF]
Notes on Number Theory and Discrete MathematicsWe 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
Holding out on restructuring negotiations: A legal analysis over Finnish and Swedish legislation
International Insolvency Review, EarlyView.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
, 2023 Divisibility rules for a divisor p are algorithms that tell us whether a given number is divisible by p or not. From the lower grades we are familiar with divisibility rules for the divisors 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 and 12, but when it comes to ...
Kanojiya, Rajkumar
core
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, EarlyView.ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 We obtain an arithmetic proof and a refinement of the inequality ϕ (nk) + σk(n) < 2nk, where n ≧ 2 and k ≧ 2. An application to another inequality is also provided.
Sándor József
doaj +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, EarlyView.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
, 2012 The plan for the paper is as follows: we shall first introduce the general notion of a matrix divisibility sequence indexed by a semigroup. Then we will see how a faithful representation of the semigroup by endomorphisms of an affine space gives rise to ...
Sub Algebra,Geometry&Mathem. Logic begr. +3 more
core +1 more source
Relating compatibility and divisibility of quantum channels
, 2021 We connect two key concepts in quantum information: compatibility and divisibility of quantum channels. Two channels are compatible if they can be both obtained via marginalization from a third channel.
Drumond, Raphael C. +2 more
core +1 more source