In a theory with linear confinement, such as QCD, the masses squared, mn,S, of mesons with high spin S or high radial excitation number n are expected, from semiclassical arguments, to grow linearly with S and n. We show that this translates into a strong constraint on the infrared behavior of a putative 5-dimensional theory holographically dual to QCD (AdS/QCD). In the simplest model which obe...

We give dual interpretations of Seiberg–Witten and Dijkgraaf–Vafa (or matrix model) curves in N = 1 supersymmetric U(N) gauge theory. This duality interchanges the rank of the gauge group with the degree of the superpotential; moreover, the constraint of having at most log-normalizable deformations of the geometry is mapped to a constraint in the number of flavors Nf < N in the dual theory. Kar...

Mathematical Program with Complementarity Constraints (MPCC) plays a very important role in many fields such as engineering design, economic equilibrium, multilevel game, and mathematical programming theory itself. In theory its constraints fail to satisfy a standard constraint qualification such as the linear independence constraint qualification (LICQ) or the Mangasarian-Fromovitz constraint ...

We present an implementation of the loop representation of quantum gravity on a square lattice. Instead of starting from a classical lattice theory, quantizing and introducing loops, we proceed backwards, setting up constraints in the lattice loop representation and showing that they have appropriate (singular) continuum limits and algebras. The diffeomorphism constraint reproduces the classica...

James Allen defined a calculus of time intervals in [A1183], as a representation of temporal knowledge that could be used in AI. We shall call this the Interval Culculus. In his paper, Allen investigated specification and constraint satisfaction in the Interval Calculus. Other constraintsatisfaction algorithms for intervals have considered subclasses of Boolean formulas only. The methods herein...

The fitness of an existing phenotype and of a potential mutant should generally depend on the frequencies of other existing phenotypes. Adaptive evolution driven by such frequency-dependent fitness functions can be analyzed effectively using adaptive dynamics theory, assuming rare mutation and asexual reproduction. When possible mutations are restricted to certain directions due to developmenta...

Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of efficient constraint propagation algorithms for problem solving. Many of the most common global constraints used in constraint programming use filtering algorithms based on network flow theory. We show how we can form...

In mathematical programming, constraint qualifications are essential elements for duality theory. Recently, necessary and sufficient constraint qualifications for Lagrange duality results have been investigated. Also, surrogate duality enables one to replace the problem by a simpler one in which the constraint function is a scalar one. However, as far as we know, a necessary and sufficient cons...

The interactivist approach to development generates a framework of types of constraints on what can be constructed. The four constraint types are based on: (1) what the constructed systems are about; (2) the representational relationship itself; (3) the nature of the systems being constructed; and (4) the process of construction itself. We give illustrations of each constraint type. Any develop...