Abstract We employ the Feedback In Realistic Environments (FIRE-2) physics model to study how properties of giant molecular clouds (GMCs) evolve during galaxy mergers. Due rarity mergers in local Universe, samples nearby merging galaxies suitable for studies individual GMCs are limited. Idealized simulations provide us with a new window GMC evolution merger, and assist interpreting observations...

We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let μvd(F ) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of variables. Our main result is an upper bound μvd(F ) ≤ nM(σ(F )) ≤ σ(F ) + 1 + log 2 (σ(F )) for lean clause-sets F in dependency on the surplus σ(F ). Lean cl...

In this paper, we revisit the Property Matching problem studied by Amir et al. [Property Matching and Weighted Matching, CPM 2006] and present a better indexing scheme for the problem. In particular, the data structure by Amir et al., namely PST, requires O(n log |Σ|+ n log log n) construction time and O(m log |Σ|+ K) query time, where n and m are the length of, respectively, the text and the p...

The following discourse is inspired by the works on hyperbolic groups of Epstein, and Neumann/Reeves. In [E], it is shown that geometrically finite hyperbolic groups are biautomatic. In [NR1], it is shown that virtually central extensions of word hyperbolic groups are biautomatic. We prove the following generalisation: Theorem 1. Let H be a geometrically finite hyperbolic group. Let σ ∈ H(H) an...

We describe a Monte Carlo scheme for simulating polydisperse fluids within the grand canonical ensemble. Given some polydisperse attribute σ, the state of the system is described by a density distribution ρ(σ) whose form is controlled by the imposed chemical potential distribution μ(σ). We detail how histogram extrapolation techniques can be employed to tune μ(σ) such as to traverse some partic...

This short paper considers certain issues surrounding the variance in the central limit theorem (CLT) for Markov chains. This subject is particularly important when using Markov chain Monte Carlo (MCMC) algorithms, see e.g. [11], [18], [7], [4], [5], [8], and [10]. Let {Xn} be a stationary, reversible Markov chain on a state space X , and let h : X → R be a mean 0 measurable function. Often, n−...

A complex manifold X X is weakly complete if it admits a continuous plurisubharmonic exhaustion function alttext="phi"...

A normal form is given for integrable linear difference-differential equations {σ(Y ) = AY, δ(Y ) = BY }, which is irreducible over C(x, t) and solvable in terms of liouvillian solutions. We refine this normal form and devise an algorithm to compute all liouvillian solutions of such kind of systems of prime order.

Process Capability: Definition and standard evaluation: Process Capability tells you, to what extent the process is likely to satisfy the customer's wish. Standard Process Capability calculations assume 99.73% coverage of the process mapped as σ 3 ± x. Where x is the process mean σ is the process standard deviation. The standard evaluation of Process Capability Indices Cp & Cpk is given by the ...

A result by Dehornoy (1992) says that every nontrivial braid admits a σ-definite word representative, defined as a braid word in which the generator σi with maximal index i appears with exponents that are all positive, or all negative. This is the ground result for ordering braids. In this paper, we enhance this result and prove that every braid admits a σ-definite word representative that, in ...