Quaternization of tetrazoles under high pressure and establishment of the structures of quaternary tetrazolium salts by 13C NMR spectroscopy

The quaternization of 1- and 2-acetonyl-5-R-tetrazoles, as well as dimethyltetrazole, was accomplished under high pressure conditions (5000–14,000 kgf/cm²) by means of bromoacetone and methyl iodide and at atmospheric pressure and room temperature under the influence of methyl fluorosulfate. The structure of the salts were ascertained by ¹³C NMR spectroscopy, and the principles of the change in the chemical shifts and the spin-spin coupling constants during quaternization and protonation of the tetrazoles were studied.Translated from Khimiya Geterotsiklicheskikh Soedinenii, No. 8, pp. 1118–1124, August, 1982.     

A strongly polynomial minimum cost circulation algorithm

A new algorithm is presented for the minimum cost circulation problem. The algorithm is strongly polynomial, that is, the number of arithmetic operations is polynomial in the number of nodes, and is independent of both costs and capacities.     

AN INDIVIDUAL‐BASED MODEL FOR FERAL HOGS IN GREAT SMOKY MOUNTAINS NATIONAL PARK

The expansion of feral hog (Sus scrofa) populations in the United States has resulted in increased efforts to develop and implement control strategies designed to minimize the impacts done by this invasive species. We describe an individual‐based model for feral hogs in Great Smoky Mountains National Park (GSMNP). The objectives of the model are to provide an understanding of the population dynamics of this feral hog population and to determine the efficacy of the annual harvest as a population control method. Results suggest that the dynamics of the population are driven by fall hard mast production and the GSMNP harvests currently limit growth of the population, but these control efforts have not reduced the population.     

An approximation algorithm for the generalized assignment problem

The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing jobj on machinei requires timep _ij and incurs a cost ofc _ij ; each machinei is available forT _i time units, and the objective is to minimize the total cost incurred. Our main result is as follows. There is a polynomial-time algorithm that, given a valueC, either proves that no feasible schedule of costC exists, or else finds a schedule of cost at mostC where each machinei is used for at most 2T _i time units.We also extend this result to a variant of the problem where, instead of a fixed processing timep _ij , there is a range of possible processing times for each machine—job pair, and the cost linearly increases as the processing time decreases. We show that these results imply a polynomial-time 2-approximation algorithm to minimize a weighted sum of the cost and the makespan, i.e., the maximum job completion time. We also consider the objective of minimizing the mean job completion time. We show that there is a polynomial-time algorithm that, given valuesM andT, either proves that no schedule of mean job completion timeM and makespanT exists, or else finds a schedule of mean job completion time at mostM and makespan at most 2T. Research partially supported by an NSF PYI award CCR-89-96272 with matching support from UPS, and Sun Microsystems, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.Research supported in part by a Packard Fellowship, a Sloan Fellowship, an NSF PYI award, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.     

Non parametric estimation of the diffusion coefficients of a diffusion with jumps

In this article, we consider a jump diffusion process ${\left(X_t\right)}_{t\ge 0}$, with drift function $b$, diffusion coefficient $\sigma$ and jump coefficient ${\xi }^2$. This process is observed at discrete times $t=0,\Delta ,\dots ,n\Delta$. The sampling interval $\Delta$ tends to 0 and the time interval $n\Delta$ tends to infinity. We assume that ${\left(X_t\right)}_{t\ge 0}$ is ergodic, strictly stationary and exponentially $\beta$-mixing. We use a penalized least-square approach to compute adaptive estimators of the functions ${\sigma }^2+{\xi }^2$ and ${\sigma }^2$. We provide bounds for the risks of the two estimators.     

Fundamental solutions to Pell equation with prescribed size

We prove that the number of parameters D up to a fixed x ≥ 2 such that the fundamental solution ? _D to the Pell equation T ² ? DU ² = 1 lies between \(D^{\tfrac{1}{2} + \alpha _1 }\) and \(D^{\tfrac{1}{2} + \alpha _2 }\) is greater than \(\sqrt x \log ^2 x\) up to a constant as long as α ₁ < α ₂ and α ₁ < 3/2. The starting point of the proof is a reduction step already used by the authors in earlier works. This approach is amenable to analytic methods. Along the same lines, and inspired by the work of Dirichlet, we show that the set of parameters D ≤ x for which log ? _D is larger than D ^¼ has a cardinality essentially larger than x ^¼ log² x.     

Iteration 2-theories

The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteration in conjunction with horizontal and vertical composition in all algebraically complete categories. We give a concrete representation of the free iteration 2-theory generated by a 2-signature.     

An Infinite Antichain of Planar Tanglegrams

Contrary to the expectation arising from the tanglegram Kuratowski theorem of Czabarka et al. (SIAM J. Discrete Math. 31(3), 1732–1750, 2017), we construct an infinite antichain of planar tanglegrams with respect to the induced subtanglegram partial order. R.E. Tarjan, R. Laver, D.A. Spielman and M. Bóna, and possibly others, showed that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain, i.e., there exists an infinite collection of permutations, such that none of them contains another as a pattern. Our construction adds a twist to the construction of Spielman and Bóna (Electr. J. Comb. 7, N2, 2000).