Gale duality and Koszul duality

Given a hyperplane arrangement in an affine space equipped with a linear functional, we define two finite-dimensional, noncommutative algebras, both of which are motivated by the geometry of hypertoric varieties. We show that these algebras are Koszul dual to each other, and that the roles of the two algebras are reversed by Gale duality. We also study the centers and representation categories of our algebras, which are in many ways analogous to integral blocks of category O.     

Koszul Bicomplexes and Generalized Koszul Complexes in Projective Dimension One

We describe Koszul type complexes associated with a linear map from any module to a free module, and vice versa with a linear map from a free module to an arbitrary module, generalizing the classical Koszul complexes. Given a short complex of finite free modules, we assemble these complexes to what we call Koszul bicomplexes. They are used in order to investigate the homology of the Koszul complexes in projective dimension one. As in the case of the classical Koszul complexes, this homology turns out to be grade sensitive. In a special setup, we obtain necessary conditions for a map of free modules to be lengthened to a short complex of free modules.     

A projected subgradient method for solving generalized mixed variational inequalities

We consider the projected subgradient method for solving generalized mixed variational inequalities. In each step, we choose an ε_k-subgradient u^k of the function f and w^k in a set-valued mapping T, followed by an orthogonal projection onto the feasible set. We prove that the sequence is weakly convergent.     

Koszul differential graded modules

The concept of Koszulity for differential graded (DG, for short) modules is introduced. It is shown that any bounded below DG module with bounded Ext-group to the trivial module over a Koszul DG algebra has a Koszul DG submodule (up to a shift and truncation), moreover such a DG module can be approximated by Koszul DG modules (Theorem 3.6). Let A be a Koszul DG algebra, and Dc(A) be the full triangulated subcategory of the derived category of DG A-modules generated by the object AA. If the trivial DG module...     

有限复杂度的Koszul代数

首先给出了Koszul代数的张量积的复杂度,然后研究了Koszul遗传代数上的Koszul单列模,并证明了Koszul遗传代数上的Koszul模M的Koszul合成列在同构意义下是唯一的.     

The behavior of best -approximations as . A counterexample of convergence

In the space of summable sequences we give an example of a one-dimensional affine subspace C such that the best L_p-approximations of 0 from C fail to converge as p↓1. We thus give an answer to this problem of convergence in infinite measure spaces.     

Quartets in maximal weakly compatible split systems

Weakly compatible split systems are a generalization of unrooted evolutionary trees and are commonly used to display reticulate evolution or ambiguity in biological data. They are collections of bipartitions of a finite set X of taxa (e.g. species) with the property that, for every four taxa, at least one of the three bipartitions into two pairs (quartets) is not induced by any of the X-splits. We characterize all split systems where exactly two quartets from every quadruple are induced by some split. On the other hand, we construct maximal weakly compatible split systems where the number of induced quartets per quadruple tends to 0 with the number of taxa going to infinity.     

Four and more

We isolate several large classes of definable proper forcings and show how they include many partial orderings used in practice.     

Koszul Algebras and Their Ideals

We study associative graded algebras that have a “complete flag” of cyclic modules with linear free resolutions, i.e., algebras over which there exist cyclic Koszul modules with any possible number of relations (from zero to the number of generators of the algebra). Commutative algebras with this property were studied in several papers by Conca and others. Here we present a noncommutative version of their construction.We introduce and study the notion of Koszul filtration in a noncommutative algebra and examine its connections with Koszul algebras and algebras with quadratic Grobner bases. We consider several examples, including monomial algebras, initially Koszul algebras, generic algebras, and algebras with one quadratic relation. It is shown that every algebra with a Koszul filtration has a rational Hilbert series.__________Translated from Funktsional’nyi Analiz i Ego Prilozheniya, Vol. 39, No. 2, pp. 47–60, 2005Original Russian Text Copyright © by D. I. PiontkovskiiSupported in part by the Russian Foundation for Basis Research under project 02-01-00468.     

Infinitely many non-negative solutions for a Dirichlet problem involving -Laplacian

In this paper, we consider a Dirichlet problem involving the p(x)-Laplacian of the type

We prove the existence of infinitely many non-negative solutions of the problem by applying a general variational principle due to B. Ricceri and the theory of the variable exponent Sobolev spaces.     

Approximation results for the weighted partition problem

We present several new standard and differential approximation results for the P₄-partition problem using the Hassin and Rubinstein algorithm [Information Processing Letters 63 (1997) 63–67]. Those results concern both minimization and maximization versions of the problem. However, the main point of this paper lies in the establishment of the robustness of this algorithm, in the sense that it provides good quality solutions for a variety of versions of the problem, under both standard and differential approximation ratios.     

Accelerating gradient projection methods for -constrained signal recovery by steplength selection rules

We propose a new gradient projection algorithm that compares favorably with the fastest algorithms available to date for ℓ₁-constrained sparse recovery from noisy data, both in the compressed sensing and inverse problem frameworks. The method exploits a line-search along the feasible direction and an adaptive steplength selection based on recent strategies for the alternation of the well-known Barzilai–Borwein rules. The convergence of the proposed approach is discussed and a computational study on both well conditioned and ill-conditioned problems is carried out for performance evaluations in comparison with five other algorithms proposed in the literature.     

A completeness result for the simply typed -calculus

In this paper, we define a realizability semantics for the simply typed λμ-calculus. We show that, if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the computational behavior of some closed typed terms. We also prove a completeness result of our realizability semantics using a particular term model.     

Co-Point Modules Over Frobenius Koszul Algebras

Let A be a Frobenius Koszul algebra such that its Koszul dual A ^! is a quantum polynomial algebra. Co-point modules over A were defined as dual notion of point modules over A ^! with respect to the Koszul duality. In this article, we will see that various important functors between module categories over A used in representation theory of finite dimensional algebras send co-point modules to co-point modules. As a consequence, we will show that if (E, σ) is a geometric pair associated to A ^!, then the map σ:E → E is an automorphism of the point scheme E of A ^!, so that there is a bijection between isomorphism classes of left point modules over A ^! and those of right point modules over A ^!.     

Reznichenko families of trees and their applications

Examples of Talagrand, Gul'ko and Corson compacta resulting from Reznichenko families of trees are presented. The K_σδ property for weakly -analytic Banach spaces with an unconditional basis is proved.     

Fixed point theorems for nonexpansive mappings and Suzuki-generalized nonexpansive mappings on a Banach lattice

We prove the existence of fixed points for multivalued nonexpansive nonself-mappings on a weakly orthogonal reflexive Banach lattice with uniformly monotone norm. Moreover, for single-valued mappings, we extend Betiuk-Pilarska and Prus’s result [A. Betiuk-Pilarska, S. Prus, Banach lattices which are order uniformly noncreasy, J. Math. Anal. Appl. 342 (2008) 1271–1279] on the weak fixed point property to continuous mappings satisfying condition (C) on a w-weakly orthogonal OUNC Banach lattice.     

Formal systems of fuzzy logic and their fragments

Formal systems of fuzzy logic (including the well-known Łukasiewicz and Gödel–Dummett infinite-valued logics) are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of non-classical logics. Here we study the fragments of nine prominent fuzzy logics to all sublanguages containing implication. However, the results achieved in the paper for those nine logics are usually corollaries of theorems with much wider scope of applicability. In particular, we show how many of these fragments are really distinct and we find axiomatic systems for most of them. In fact, we construct strongly separable axiomatic systems for eight of our nine logics. We also fully answer the question for which of the studied fragments the corresponding class of algebras forms a variety. Finally, we solve the problem how to axiomatize predicate versions of logics without the lattice disjunction (an essential connective in the usual axiomatic system of fuzzy predicate logics).     

The binding number of a graph and its cliques

We consider the binding numbers of K_r-free graphs, and improve the upper bounds on the binding number which force a graph to contain a clique of order r. For the case r=4, we provide a construction for K₄-free graphs which have a larger binding number than the previously known constructions. This leads to a counterexample to a conjecture by Caro regarding the neighborhoods of independent sets.     

On the complexity of some subgraph problems

We study the complexity of the problem of deciding the existence of a spanning subgraph of a given graph, and of that of finding a maximum (weight) such subgraph. We establish some general relations between these problems, and we use these relations to obtain new NP-completeness results for maximum (weight) spanning subgraph problems from analogous results for existence problems and from results in extremal graph theory. On the positive side, we provide a decomposition method for the maximum (weight) spanning chordal subgraph problem that can be used, e.g., to obtain a linear (or O(nlogn)) time algorithm for such problems in graphs with vertex degree bounded by 3.     

On Banach spaces whose norm-open sets are -sets in the weak topology

We investigate non-separable Banach spaces whose norm-open sets are countable unions of sets closed in the weak topology and a narrower class of Banach spaces with a network for the norm topology which is σ-discrete in the weak topology. In particular, we answer a question of Arhangel'skii exhibiting various examples of non-separable function spaces C(K) with a σ-discrete network for the pointwise topology and (consistently) we answer some questions of Edgar and Oncina concerning Borel structures and Kadec renormings in Banach spaces.