Related papers: Higher Lawrence configurations
The paper describes known and new results about finite difference calculus on configuration spaces. We describe finite difference geometry on configuration spaces, connect finite difference operators with cannonical commutation relations,…
To each associative unitary finite-dimensional algebra over a normal base, we associative a canonical multiplicative function called its determinant. We give various properties of this construction, as well as applications to the topology…
A detailed combinatorial analysis of planar lattice convex polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained. The…
We show that the singular loci of graph hypersurfaces correspond set-theoretically to their rank loci. The proof holds for all configuration hypersurfaces and depends only on linear algebra. To make the conclusion for the second graph…
The ground spaces of a vector space of hermitian matrices, partially ordered by inclusion, form a lattice constructible from top to bottom in terms of intersections of maximal ground spaces. In this paper we characterize the lattice…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
In this paper, we study a class of stochastic Generalized Linear Switched System (GLSS), which includes subclasses of jump-Markov, piecewide-linear and Linear Parameter-Varying (LPV) systems. We prove that the output of such systems can be…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…
We give very flexible, concrete constructions of discrete and faithful epresentations of right-angled Artin groups into higher-rank Lie groups. Using the geometry of the associated symmetric spaces and the combinatorics of the groups, we…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
It is shown that the set of all finitary consequence operators defined on any nonempty language is a join-complete lattice. This result is applied to various collections of physical theories to obtain an unrestricted supremum unification.
We describe the orbit structure for the action of the centralizer group of a linear operator on a finite-dimensional complex vector space. The main application is to the classification of solutions to a system of first-order ODEs with…
We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…
We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all, we show that the framework is indeed applicable to those…
We construct a higher lattice gauge theory based on the representation of 2-groups described by a category of crossed modules on a lattice model described by path 2-groupoids. Using these lattice gauge representations, an exactly solvable…
A general elliptic $N\times N$ matrix Lax scheme is presented, leading to two classes of elliptic lattice systems, one which we interpret as the higher-rank analogue of the Landau-Lifschitz equations, while the other class we characterize…
Vector fields with components which are generalized zero-forms are constructed. Inner products with generalized forms, Lie derivatives and Lie brackets are computed. The results are shown to generalize previously reported results for…
In this paper we translate the necessary and sufficient conditions of Tanaka's theorem on the finiteness of effective prolongations of a fundamental graded Lie algebras into computationally effective criteria, involving the rank of some…
We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…