A Matrix Model for \nu_{k_1k_2}=\frac{k_1+k_2}{k_1 k_2} Fractional Quantum Hall States

We propose a matrix model to describe a class of fractional quantum Hall (FQH) states for a system of (N_1+N_2) electrons with filling factor more general than in the Laughlin case. Our model, which is developed for FQH states with filling factor of the form \nu_{k_1k_2}=\frac{k_1+k_2}{k_1k_2} (k_1 and k_2 odd integers), has a U(N_1)\times U(N_2) gauge invariance, assumes that FQH fluids are composed of coupled branches of the Laughlin type, and uses ideas borrowed from hierarchy scenarios. Interactions are carried, amongst others, by fields in the bi-fundamentals of the gauge group. They simultaneously play the role of a regulator, exactly as does the Polychronakos field. We build the vacuum configurations for FQH states with filling factors given by the series \nu_{p_1p_2}=\frac{p_2}{p_1p_2-1}, p_1 and p_2 integers. Electrons are interpreted as a condensate of fractional D0-branes and the usual degeneracy of the fundamental state is shown to be lifted by the non-commutative geometry behaviour of the plane. The formalism is illustrated for the state at \nu={2/5}.Comment: 40 pages, 1 figure, clarifications and references adde

On Matrix KP and Super-KP Hierarchies in the Homogeneous Grading

Constrained KP and super-KP hierarchies of integrable equations (generalized NLS hierarchies) are systematically produced through a Lie algebraic AKS-matrix framework associated to the homogeneous grading. The role played by different regular elements to define the corresponding hierarchies is analyzed as well as the symmetry properties under the Weyl group transformations. The coset structure of higher order hamiltonian densities is proven.\par For a generic Lie algebra the hierarchies here considered are integrable and essentially dependent on continuous free parameters. The bosonic hierarchies studied in \cite{{FK},{AGZ}} are obtained as special limit restrictions on hermitian symmetric-spaces.\par In the supersymmetric case the homogeneous grading is introduced consistently by using alternating sums of bosons and fermions in the spectral parameter power series.\par The bosonic hierarchies obtained from ${\hat {sl(3)}}$ and the supersymmetric ones derived from the $N=1$ affinization of $sl(2)$, $sl(3)$ and $osp(1|2)$ are explicitly constructed. \par An unexpected result is found: only a restricted subclass of the $sl(3)$ bosonic hierarchies can be supersymmetrically extended while preserving integrability.Comment: 36 pages, LaTe

Lexicographically-ordered constraint satisfaction problems

We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two are easily distinguished conceptually and for purposes of problem solving. Preferences are represented as a lexicographic order over complete assignments based on variable importance and rankings of values in each domain. Feasibility constraints are treated in the usual manner. Since the preference representation is ordinal in character, these problems can be solved with algorithms that do not require evaluations to be represented explicitly. This includes ordinary CSP algorithms, although these cannot stop searching until all solutions have been checked, with the important exception of heuristics that follow the preference order (lexical variable and value ordering). We describe relations between lexicographic CSPs and more general soft constraint formalisms and show how a full lexicographic ordering can be expressed in the latter. We discuss relations with (T)CP-nets, highlighting the advantages of the present formulation, and we discuss the use of lexicographic ordering in multiobjective optimisation. We also consider strengths and limitations of this form of representation with respect to expressiveness and usability. We then show how the simple structure of lexicographic CSPs can support specialised algorithms: a branch and bound algorithm with an implicit cost function, and an iterative algorithm that obtains optimal values for successive variables in the importance ordering, both of which can be combined with appropriate variable ordering heuristics to improve performance. We show experimentally that with these procedures a variety of problems can be solved efficiently, including some for which the basic lexically ordered search is infeasible in practice

Foreign objects? Web content management systems, journalistic cultures and the ontology of software

Research on ‘digital’ journalism has focused largely on online news, with comparatively less interest in the longer-term implications of software and computational technologies. Drawing upon a six-year study of the Toronto Star, this paper provides an account of TOPS, an in-house web content management system (CMS) which served as the backbone of thestar.com for six years. For some, TOPS was a successful software innovation, while for others, a strategic digital ‘property’. But for most journalists, it was slow, deficient in functionality, aesthetically unappealing and cumbersome. Although several organizational factors can explain TOPS’ obstinacy, I argue for particular attention to the complex ontology of software. Based on an outline of this ontology, I suggest software be taken seriously as an object of journalism, which implies: acknowledging its partial autonomy from human use or authorization; accounting for its ability to mutate indefinitely; and analyzing its capacity to encourage forms of ‘computational thinking

Conformal Matrix Models as an Alternative to Conventional Multi-Matrix Models

We introduce {\it conformal multi-matrix models} (CMM) as an alternative to conventional multi-matrix model description of two-dimensional gravity interacting with $c < 1$ matter. We define CMM as solutions to (discrete) extended Virasoro constraints. We argue that the so defined alternatives of multi-matrix models represent the same universality classes in continuum limit, while at the discrete level they provide explicit solutions to the multi-component KP hierarchy and by definition satisfy the discrete $W$-constraints. We prove that discrete CMM coincide with the $(p,q)$-series of 2d gravity models in a {\it well}-{\it defined} continuum limit, thus demonstrating that they provide a proper generalization of Hermitian one-matrix model.Comment: 35 pages, preprint FIAN/TD-9/92 & ITEP-M-4/9

MULTIHIERARCHICAL DOCUMENTS AND FINE-GRAINED ACCESS CONTROL

This work presents new models and algorithms for creating, modifying, and controlling access to complex text. The digitization of texts opens new opportunities for preservation, access, and analysis, but at the same time raises questions regarding how to represent and collaboratively edit such texts. Two issues of particular interest are modelling the relationships of markup (annotations) in complex texts, and controlling the creation and modification of those texts. This work addresses and connects these issues, with emphasis on data modelling, algorithms, and computational complexity; and contributes new results in these areas of research. Although hierarchical models of text and markup are common, complex texts often exhibit layers of overlapping structure that are best described by multihierarchical markup. We develop a new model of multihierarchical markup, the globally ordered GODDAG, that combines features of both graph- and range-based models of markup, allowing documents to be unambiguously serialized. We describe extensions to the XPath query language to support globally ordered GODDAGs, provide semantics for a set of update operations on this structure, and provide algorithms for converting between two different representations of the globally ordered GODDAG. Managing the collaborative editing of documents can require restricting the types of changes different editors may make, while not altogether restricting their access to the document. Fine-grained access control allows precisely these kinds of restrictions on the operations that a user is or is not permitted to perform on a document. We describe a rule-based model of fine-grained access control for updates of hierarchical documents, and in this context analyze the document generation problem: determining whether a document could have been created without violating a particular access control policy. We show that this problem is undecidable in the general case and provide computational complexity bounds for a number of restricted variants of the problem. Finally, we extend our fine-grained access control model from hierarchical to multihierarchical documents. We provide semantics for fine-grained access control policies that control splice-in, splice-out, and rename operations on globally ordered GODDAGs, and show that the multihierarchical version of the document generation problem remains undecidable