This talk discusses some recent studies of gluon saturation in nuclei. We stress the connection between the initial condition in heavy ion collisions and observables in deep inelastic scattering (DIS). The dominant degree of freedom in the small x nuclear wavefunction is a nonperturbatively strong classical gluon field, which determines the initial condition for the glasma fields in the initial...

We study F-saturation games, first introduced by Füredi, Reimer and Seress [1] in 1991, and named as such by West [2]. A graph G is H-saturated if H is not a subgraph of G, but adding any edge to G causes H to be a subgraph. We can ask what the minimum or maximum number of edges in an H-saturated graph on n vertices is they are known as the saturation number and Turán number (extremal number), ...

Deduction modulo is a framework in which theories are integrated into proof systems such as natural deduction or sequent calculus by presenting them using rewriting rules. When only terms are rewritten, cut admissibility in those systems is equivalent to the confluence of the rewriting system, as shown by Dowek, RTA 2003, LNCS 2706. This is no longer true when considering rewriting rules involv...

A book Bp is a union of p triangles sharing one edge. This idea was extended to a generalized book Bb,p, which is the union of p copies of a Kb+1 sharing a common Kb. A graph G is called an H-saturated graph if G does not contain H as a subgraph, but G∪ {xy} contains a copy of H, for any two nonadjacent vertices x and y. The saturation number of H, denoted by sat(H,n), is the minimum number of ...

A graph G = (V,E) is said to be saturated with respect to a monotone increasing graph property P, if G / ∈ P but G ∪ {e} ∈ P for every e ∈ ( V 2 ) \ E. The saturation game (n,P) is played as follows. Two players, called Mini and Max, progressively build a graph G ⊆ Kn, which does not satisfy P. Starting with the empty graph on n vertices, the two players take turns adding edges e ∈ ( V (Kn) 2 )...

Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrated theory reasoning. The most efficient SMT solvers rely on refutationally incomplete methods for incorporating quantifier reasoning. We describe a calculus and a system that tightly integrates Superposition and DPLL(T). In the calculus, all non-unit ground clauses are delegated to the D...

The class of shape equivalences for a pair (C,K) of categories is the orthogonal of K, that is Σ = K. Then Σ is internally saturated (Σ = Σ). On the other hand, every internally saturated class of morphisms Σ ⊂ Mor(C), is the class of shape equivalences for some pair (C,K). Moreover, every class of shape equivalences Σ enjoys a calculus of left fractions and such a fact allows one to use techni...

delay is one of the principal measures of performance used to determine the level of service (los) at signalized intersections and several methods have been widely used to estimate vehicular delay. very few studies only have been carried out to estimate delay at signalized intersections under mixed traffic conditions prevailing in developing countries like india. in the present study, various p...

multiple coupled circuit modeling of squirrel-cage induction motors, or winding function approach is the most detailed and complete analytical model used to analyze the performance of the faulty induction motors. this paper extends the above-mentioned model to a saturable model including variable degrees of the saturation effects using an appropriate air gap function and novel techniques for lo...