Representation Dimension and Quasi-hereditary Algebras

We study Auslander's representation dimension of Artin algebras, which is by definition the minimal projective dimension of coherent functors on modules which are both generators and cogenerators. We show the following statements: (1) if an Artin algebra A is stably hereditary, then the representation dimension of A is at most 3. (2) If two Artin algebras are stably equivalent of Morita type, then they have the same representation dimension. Particularly, if two self-injective algebras are derived equivalent, then they have the same representation dimension. (3) Any incidence algebra of a finite partially ordered set over a field has finite representation dimension. Moreover, we use results on quasi-hereditary algebras to show that (4) the Auslander algebra of a Nakayama algebra has finite representation dimension.     

The representation dimension of domestic weakly symmetric algebras

Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically closed fields having simply connected Galois coverings.     

Representing probability measures using probabilistic processes

In the Type-2 Theory of Effectivity, one considers representations of topological spaces in which infinite words are used as “names” for the elements they represent. Given such a representation, we show that probabilistic processes on infinite words, under which each successive symbol is determined by a finite probabilistic choice, generate Borel probability measures on the represented space. Conversely, for several well-behaved types of space, every Borel probability measure is represented by a corresponding probabilistic process. Accordingly, we consider probabilistic processes as providing “probabilistic names” for Borel probability measures. We show that integration is computable with respect to the induced representation of measures.     

Mixing Shifts of Finite Type with Non-Elementary Surjective Dimension Representations

The dimension representation has been a useful tool in studying the mysterious automorphism group of a shift of finite type, the classification of shifts of finite type, and surrounding problems. We discuss the importance of understanding the image of the dimension representation and discuss the candidate range for the fundamental case of mixing shifts of finite type. We present the first class of examples of mixing shifts of finite type for which the dimension representation is surjective necessarily using non-elementary conjugacies.     

Multidimensional Cooley–Tukey Algorithms Revisited

The representation theory of Abelian groups is used to obtain an algebraic divide-and-conquer algorithm for computing the finite Fourier transform. The algorithm computes the Fourier transform of a finite Abelian group in terms of the Fourier transforms of an arbitrary subgroup and its quotient. From this algebraic algorithm a procedure is derived for obtaining concrete factorizations of the Fourier transform matrix in terms of smaller Fourier transform matrices, diagonal multiplications, and permutations. For cyclic groups this gives as special cases the Cooley–Tukey and Good–Thomas algorithms. For groups with several generators, the procedure gives a variety of multidimensional Cooley–Tukey type algorithms. This method of designing multidimensional fast Fourier transform algorithms gives different data flow patterns from the standard “row–column” approaches. We present some experimental evidence that suggests that in hierarchical memory environments these data flows are more efficient.     

Limits of Pure-Injective Cotilting Modules

The set of pure-injective cotilting modules over an artin algebra is shown to have a monoid structure. This monoid structure does not restrict down to a monoid structure on the finitely generated cotilting modules in general, but it does whenever the algebra is of finite representation type. Pure-injective cotilting modules are also constructed from any set of finitely generated cotilting modules with bounded injective dimension. Presented by Y. Drozd Mathematics Subject Classifications (2000) 16G10, 16P20, 16E30.     

Artin-Schelter regular algebras and categories

Motivated by constructions in the representation theory of finite dimensional algebras we generalize the notion of Artin-Schelter regular algebras of dimension n to algebras and categories to include Auslander algebras and a graded analogue for infinite representation type. A generalized Artin-Schelter regular algebra or a category of dimension n is shown to have common properties with the classical Artin-Schelter regular algebras. In particular, when they admit a duality, then they satisfy Serre duality formulas and the -category of nice sets of simple objects of maximal projective dimension n is a finite length Frobenius category.     

Representation of the Variational Sequence by Differential Forms

In the paper the representation of the finite order variational sequence on fibered manifolds in field theory is studied. The representation problem is completely solved by a generalization of the integration by parts procedure using the concept of the Lie derivative of forms with respect to vector fields along canonical maps of prolongations of fibered manifolds. A close relationship between the obtained coordinate invariant representation of the variational sequence and some familiar objects of physics, such as Lagrangians, dynamical forms, Euler–Lagrange mapping and Helmholtz–Sonin mapping is pointed out and illustrated by examples.Mathematics Subject Classifications (2000) 58E99, 49F99.Jana Musilová: Research of both authors supported by grants MSM 0021622409 and 201/03/0512.     

Gabor frames and directional time–frequency analysis

We introduce a directionally sensitive time–frequency decomposition and representation of functions. The coefficients of this representation allow us to measure the “amount” of frequency a function (signal, image) contains in a certain time interval, and also in a certain direction. This has been previously achieved using a version of wavelets called ridgelets [E.J. Candès, Harmonic analysis of neural networks, Appl. Comput. Harmon. Anal. 6 (1999) 197–218. [2]; E.J. Candès, D.L. Donoho, New tight frames of curvelets and optimal representations of objects with piesewise-C² singularities, Comm. Pure Appl. Math. 57 (2004) 219–266. [3]] but in this work we discuss an approach based on time–frequency or Gabor elements. For such elements, a Parseval formula and a continuous frame-type representation together with boundedness properties of a semi-discrete frame operator are obtained. Spaces of functions tailored to measure quantitative properties of the time–frequency–direction analysis coefficients are introduced and some of their basic properties are discussed. Applications to image processing and medical imaging are presented.     

Onsager-Machlup functionals and maximum a posteriori estimation for a class of non-gaussian random fields

The “prior density for path” (the Onsager-Machlup functional) is defined for solutions of semilinear elliptic type PDEs driven by white noise. The existence of this functional is proved by applying a general theorem of Ramer on the equivalence of measures on Wiener space. As an application, the maximum a posteriori (MAP) estimation problem is considered where the solution of the semilinear equation is observed via a noisy nonlinear sensor. The existence of the optimal estimator and its representation by means of appropriate first-order conditions are derived.     

Exploiting structure in quantified formulas

We study the computational problem “find the value of the quantified formula obtained by quantifying the variables in a sum of terms.” The “sum” can be based on any commutative monoid, the “quantifiers” need only satisfy two simple conditions, and the variables can have any finite domain. This problem is a generalization of the problem “given a sum-of-products of terms, find the value of the sum” studied in [R.E. Stearns and H.B. Hunt III, SIAM J. Comput. 25 (1996) 448–476]. A data structure called a “structure tree” is defined which displays information about “subproblems” that can be solved independently during the process of evaluating the formula. Some formulas have “good” structure trees which enable certain generic algorithms to evaluate the formulas in significantly less time than by brute force evaluation. By “generic algorithm,” we mean an algorithm constructed from uninterpreted function symbols, quantifier symbols, and monoid operations. The algebraic nature of the model facilitates a formal treatment of “local reductions” based on the “local replacement” of terms. Such local reductions “preserve formula structure” in the sense that structure trees with nice properties transform into structure trees with similar properties. These local reductions can also be used to transform hierarchical specified problems with useful structure into hierarchically specified problems having similar structure.     

On a robust version of the integral representation formula of nonlinear filtering

The paper is concerned with completing “unfinished business” on a robust representation formula for the conditional expectation operator of nonlinear filtering. Such a formula, robust in the sense that its dependence on the process of observations is continuous, was stated in [2] without proof. The main purpose of this paper is to repair this deficiency.The formula is “almost obvious” as it can be derived at a formal level by a process of integration-by-parts applied to the stochastic integrals that appear in the integral representation formula. However, the rigorous justification of the formula is quite subtle, as it hinges on a measurability argument the necessity of which is easy to miss at first glance. The continuity of the representation (but not its validity) was proved by Kushner [9] for a class of diffusions.Here we follow the definition given in [11].     

Uniformly generated submodules of permutation modules: Over fields of characteristic 0

This paper is motivated by a link between algebraic proof complexity and the representation theory of the finite symmetric groups. Our perspective leads to a new avenue of investigation in the representation theory of S_n. Most of our technical results concern the structure of “uniformly” generated submodules of permutation modules. For example, we consider sequences of submodules of the permutation modules M^(n−k,1k) and prove that if the sequence W_n is given in a uniform (in n) way – which we make precise – the dimension p(n) of W_n (as a vector space) is a single polynomial with rational coefficients, for all but finitely many “singular” values of n. Furthermore, we show that dim(W_n)<p(n) for each singular value of n≥4k. The results have a non-traditional flavor arising from the study of the irreducible structure of the submodules W_n beyond isomorphism types. We sketch the link between our structure theorems and proof complexity questions, which are motivated by the famous NP vs. co-NP problem in complexity theory. In particular, we focus on the complexity of showing membership in polynomial ideals, in various proof systems, for example, based on Hilbert's Nullstellensatz.     

Representation of convex geometries by circles on the plane

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an $n$-dimensional space equipped with a convex hull operator, by the result of Kashiwabara et al. (2005). Allowing circles rather than points, as was suggested by Czédli (2014), may presumably reduce the dimension for representation. This paper introduces a property, the Weak 2 × 3-Carousel rule, which is satisfied by all convex geometries of circles on the plane, and we show that it does not hold in all finite convex geometries. This raises a number of representation problems for convex geometries, which may allow us to better understand the properties of Euclidean space related to its dimension.     

Finitistic dimension and Igusa–Todorov algebras

The notion of Igusa–Todorov algebras is introduced in connection with the (little) finitistic dimension conjecture, and the conjecture is proved for those algebras. Such algebras contain many known classes of algebras over which the finitistic dimension conjecture holds, e.g., algebras with the representation dimension at most 3, algebras with radical cube zero, monomial algebras and left serial algebras, etc. It is an open question whether all artin algebras are Igusa–Todorov. We provide some methods to construct many new classes of (2-)Igusa–Todorov algebras and thus obtain many algebras such that the finitistic dimension conjecture holds. In particular, we show that the class of 2-Igusa–Todorov algebras is closed under taking endomorphism algebras of projective modules. Hence, if all quasi-hereditary algebras are 2-Igusa–Todorov, then all artin algebras are 2-Igusa–Todorov by [V. Dlab, C.M. Ringel, Every semiprimary ring is the endomorphism ring of a projective module over a quasihereditary ring, Proc. Amer. Math. Soc. 107 (1) (1989) 1–5] and have finite finitistic dimension.     

Nearly monotone and nearly convex approximation by smooth splines in ,

Given a monotone or convex function on a finite interval we construct splines of arbitrarily high order having maximum smoothness which are “nearly monotone” or “nearly convex” and provide the rate of -approximation which can be estimated in terms of the third or fourth (classical or Ditzian–Totik) moduli of smoothness (for uniformly spaced or Chebyshev knots). It is known that these estimates are impossible in terms of higher moduli and are no longer true for “purely monotone” and “purely convex” spline approximation.     

Bier Spheres and Posets

In 1992 Thomas Bier presented a strikingly simple method to produce a huge number of simplicial (n – 2)-spheres on 2n vertices, as deleted joins of a simplicial complex on n vertices with its combinatorial Alexander dual. Here we interpret his construction as giving the poset of all the intervals in a boolean algebra that “cut across an ideal.” Thus we arrive at a substantial generalization of Bier’s construction: the Bier posets Bier(P, I) of an arbitrary bounded poset P of finite length. In the case of face posets of PL spheres this yields cellular “generalized Bier spheres.” In the case of Eulerian or Cohen–Macaulay posets P we show that the Bier posets Bier(P, I) inherit these properties. In the boolean case originally considered by Bier, we show that all the spheres produced by his construction are shellable, which yields “many shellable spheres,” most of which lack convex realization. Finally, we present simple explicit formulas for the g-vectors of these simplicial spheres and verify that they satisfy a strong form of the g-conjecture for spheres.     

The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the “convex feasibility” problem. This is the third paper in a series on a study of the rate of convergence for the cyclic projections algorithm. In the first of these papers, we showed that the rate could be described in terms of the “angles” between the convex sets involved. In the second, we showed that these angles often had a more tractable formulation in terms of the “norm” of the product of the (nonlinear) metric projections onto related convex sets.In this paper, we show that the rate of convergence of the cyclic projections algorithm is also intimately related to the “linear regularity property” of Bauschke and Borwein, the “normal property” of Jameson (as well as Bakan, Deutsch, and Li’s generalization of Jameson’s normal property), the “strong conical hull intersection property” of Deutsch, Li, and Ward, and the rate of convergence of iterated parallel projections. Such properties have already been shown to be important in various other contexts as well.     

Reading “A variant of the Hales–Jewett theorem” on its anniversary

In a recent paper “A variant of the Hales–Jewett theorem”, M. Beiglböck provides a version of the classic coloring result in which an instance of the variable in a word giving rise to a monochromatic combinatorial line can be moved around in a finite structure of specified type (for example, an arithmetic progression). We give an elementary proof and infinitary extensions.     

Triangular Matrix Representations

In this paper we develop the theory of generalized triangular matrix representation in an abstract setting. This is accomplished by introducing the concept of a set of left triangulating idempotents. These idempotents determine a generalized triangular matrix representation for an algebra. The existence of a set of left triangulating idempotents does not depend on any specific conditions on the algebras; however, if the algebra satisfies a mild finiteness condition, then such a set can be refined to a “complete” set of left triangulating idempotents in which each “diagonal” subalgebra has no nontrivial generalized triangular matrix representation. We then apply our theory to obtain new results on generalized triangular matrix representations, including extensions of several well known results.