We present a new proof of a result by Kodiyalam-Raghavan [7] and Kreiman-Lakshmibai [11], which gives an explicit Gröbner basis for the ideal of the tangent cone at any T -fixed point of a Richardson variety in the Grassmannian. Our proof uses a generalization of the RobinsonSchensted-Knuth correspondence.

0. Introduction. In this note, k denotes a field of characteristic p > 0, and the letters T, X and Y are formal indeterminants. Let F: k[[T]] —• /c[[X,Y]] be a (fixed) one-dimensional formal group law [Dieudonné, Hazewinkel, Lazard, Lubin] of height h > 0. Let V denote a k[[T]] module of finite length. Suppose Ann(V) = (T). Let q = p denote the least power of p such that n < q. It follows that ...

This paper, a continuation of [16], connects the analysis of the length of the longest weakly increasing subsequence of inhomogeneous random words to a Riemann-Hilbert problem and an associated system of integrable PDEs. That such a connection exists is not so surprising given the fundamental work of Baik, Deift and Johansson [3] connecting the related problem involving random permutations to a...

Taking our inspiration from modal correspondence theory, we present the idea of correspondence analysis for many-valued logics. As a benchmark case, we study truth-functional extensions of the Logic of Paradox (L P). First, we characterize each of the possible truth table entries for unary and binary operators that could be added to L P by an inference scheme. Second, we define a class of natur...

In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent calculus into a variant of the λ-calculus, specifically a variant which manipulates formally “applicative contexts” and inverts the associativity of “applicative terms”. Herbelin worked with a fragment of sequent calculus with c...

This paper presents formal techniques for analysis of executions of organizational scenarios based on processoriented models of organizations. A part of these techniques is dedicated to establishing the correspondence between formalized executions (i.e., traces) and process-oriented models. Other techniques provide the analyst with wide possibilities to analyze organizational dynamics and to ev...

An idempotent phonological grammar maps phonotactically licit forms faithfully to themselves. This paper establishes tight sufficient conditions for idempotency in (classical) Optimality Theory. Building on Tesar (2013), these conditions are derived in two steps. First, idempotency is shown to follow from a general formal condition on the faithfulness constraints. Second, this condition is show...

An idempotent phonological grammar maps phonotactically licit forms faithfully to themselves. This paper establishes tight sufficient conditions for idempotency in (classical) Optimality Theory. Building on Tesar (2013), these conditions are derived in two steps. First, idempotency is shown to follow from a general formal condition on the faithfulness constraints. Second, this condition is show...

Refactoring allows changing a program without changing its behaviour from an observer’s point of view. To what extent does this invariant of behaviour also preserve security? We show that a program remains secure under refactoring. As a foundation, we use the Decentralized Label Model (DLM) for specifying secure information flows of programs and transition system models for their observable beh...

We investigate the task of skeptically reasoning in extensionbased, nonmonotonic logics by concentrating on general argumentation theories. The restricted applicability of Dung’s notion of skeptical provability in his well-known argumentation framework is illustrated, and a new approach based on the notion of a claim associated with each argument is proposed. We provide a formal definition of a...