Separating invariants and local cohomology

The study of separating invariants is a recent trend in invariant theory. For a finite group acting linearly on a vector space, a separating set is a set of invariants whose elements separate the orbits of G. In some ways, separating sets often exhibit better behavior than generating sets for the ring of invariants. We investigate the least possible cardinality of a separating set for a given G-action. Our main result is a lower bound that generalizes the classical result of Serre that if the ring of invariants is polynomial then the group action must be generated by pseudoreflections. We find these bounds to be sharp in a wide range of examples.     

An exposition of Hrushovskiʼs New Strongly Minimal Set

We give an exposition of Hrushovski?s New Strongly Minimal Set (1993): A strongly minimal theory which is not locally modular but does not interpret an infinite field. We give an exposition of his construction.     

The modular properties and the integral representations of the multiple elliptic gamma functions

We show the modular properties of the multiple “elliptic” gamma functions, which are an extension of those of the theta function and the elliptic gamma function. The modular property of the theta function is known as Jacobi's transformation, and that of the elliptic gamma function was provided by Felder and Varchenko. In this paper, we deal with the multiple sine functions, since the modular properties of the multiple elliptic gamma functions result from the equivalence between two ways to represent the multiple sine functions as infinite products.We also derive integral representations of the multiple sine functions and the multiple elliptic gamma functions. We introduce correspondences between the multiple elliptic gamma functions and the multiple sine functions.     

Spreads of nonsingular pairs in symplectic vector spaces

Let V be a vector space of dimension 2n, n even, over a field F, equipped with a nonsingular symplectic form. We define a new algebraic/combinatorial structure, a spread of nonsingular pairs, or nsp-spread, on V and show that nsp-spreads exist in considerable generality. We further examine in detail some particular cases.     

On the a priori estimates for the Euler, the Navier-Stokes and the quasi-geostrophic equations

We prove new a priori estimates for the 3D Euler, the 3D Navier-Stokes and the 2D quasi-geostrophic equations by the method of similarity transforms.     

h-Vectors of matroids and logarithmic concavity

Let M be a matroid on E, representable over a field of characteristic zero. We show that h-vectors of the following simplicial complexes are log-concave:

1.

The matroid complex of independent subsets of E.     

The switching element for a Leonard pair

Let V denote a vector space with finite positive dimension. We consider a pair of linear transformations A:V→V and A^∗:V→V that satisfy (i) and (ii) below:

(i)

There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing A^∗ is diagonal.

(ii)

There exists a basis for V with respect to which the matrix representing A^∗ is irreducible tridiagonal and the matrix representing A is diagonal.

We call such a pair a Leonard pair on V. Let (resp. ) denote a basis for V referred to in (i) (resp. (ii)). We show that there exists a unique linear transformation S:V→V that sends v₀ to a scalar multiple of v_d, fixes w₀, and sends w_i to a scalar multiple of w_i for 1?i?d. We call S the switching element. We describe S from many points of view.     

Balanced Leonard pairs

Let K denote a field, and let V denote a vector space over K with finite positive dimension. By a Leonard pair on V we mean an ordered pair of linear transformations A : V → V and A^∗ : V → V that satisfy the following two conditions:

(i)

There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing A^∗ is diagonal.

(ii)

There exists a basis for V with respect to which the matrix representing A^∗ is irreducible tridiagonal and the matrix representing A is diagonal.

Let (respectively v₀, v₁, … , v_d) denote a basis for V that satisfies (i) (respectively (ii)). For 0 ? i ? d, let a_i denote the coefficient of , when we write as a linear combination of , and let denote the coefficient of v_i, when we write A^∗v_i as a linear combination of v₀, v₁, … , v_d.In this paper we show a₀ = a_d if and only if . Moreover we show that for d ? 1 the following are equivalent; (i) a₀ = a_d and a₁ = a_d−1; (ii) and ; (iii) a_i = a_d−i and for 0 ? i ? d. These give a proof of a conjecture by the second author. We say A, A^∗ is balanced whenever a_i = a_d−i and for 0 ? i ? d. We say A,A^∗ is essentially bipartite (respectively essentially dual bipartite) whenever a_i (respectively ) is independent of i for 0 ? i ? d. Observe that if A, A^∗ is essentially bipartite or dual bipartite, then A, A^∗ is balanced. For d ≠ 2, we show that if A, A^∗ is balanced then A, A^∗ is essentially bipartite or dual bipartite.     

Some trace formulae involving the split sequences of a Leonard pair

Let K denote a field, and let V denote a vector space over K with finite positive dimension. We consider a pair of linear transformations A : V → V and A^∗ : V → V that satisfy (i) and (ii) below:

(i)

There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing A^∗ is diagonal.

(ii)

There exists a basis for V with respect to which the matrix representing A^∗ is irreducible tridiagonal and the matrix representing A is diagonal.

We call such a pair a Leonard pair on V. Let diag(θ₀, θ₁, … , θ_d) denote the diagonal matrix referred to in (ii) above and let denote the diagonal matrix referred to in (i) above. It is known that there exists a basis u₀, u₁, … , u_d for V and there exist scalars ?₁, ?₂, … , ?_d in K such that Au_i = θ_iu_i + u_i+1 (0 ? i ? d − 1), Au_d = θ_du_d, , . The sequence ?₁, ?₂, … , ?_d is called the first split sequence of the Leonard pair. It is known that there exists a basis v₀, v₁, … , v_d for V and there exist scalars ?₁, ?₂, … , ?_d in K such that Av_i = θ_d−iv_i + v_i+1 (0 ? i ? d − 1),Av_d = θ₀v_d, , . The sequence ?₁, ?₂, … , ?_d is called the second split sequence of the Leonard pair. We display some attractive formulae for the first and second split sequence that involve the trace function.     

The structure of a tridiagonal pair

Let K denote a field and let V denote a vector space over K with finite positive dimension.We consider a pair of K-linear transformations A:V→V and A^∗:V→V that satisfy the following conditions: (i) each of A,A^∗ is diagonalizable; (ii) there exists an ordering of the eigenspaces of A such that A^∗V_i⊆V_i-1+V_i+V_i+1 for 0?i?d, where V_-1=0 and V_d+1=0; (iii) there exists an ordering of the eigenspaces of A^∗ such that for 0?i?δ, where and ; (iv) there is no subspace W of V such that AW⊆W,A^∗W⊆W,W≠0,W≠V.We call such a pair a tridiagonal pair on V. It is known that d=δ and for 0?i?d the dimensions of coincide.In this paper we show that the following (i)-(iv) hold provided that K is algebraically closed: (i) Each of has dimension 1.(ii) There exists a nondegenerate symmetric bilinear form 〈,〉 on V such that 〈Au,v〉=〈u,Av〉 and 〈A^∗u,v〉=〈u,A^∗v〉 for all u,v∈V.(iii) There exists a unique anti-automorphism of End(V) that fixes each of A,A^∗.(iv) The pair A,A^∗ is determined up to isomorphism by the data , where θ_i (resp.) is the eigenvalue of A (resp.A^∗) on V_i (resp.), and is the split sequence of A,A^∗ corresponding to and .     

Linear transformations that are tridiagonal with respect to both eigenbases of a Leonard pair

Let V denote a vector space with finite positive dimension. We consider a pair of linear transformations A : V → V and A^∗ : V → V that satisfy (i) and (ii) below:

(i)

There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing A^∗ is diagonal.

(ii)

There exists a basis for V with respect to which the matrix representing A^∗ is irreducible tridiagonal and the matrix representing A is diagonal.

We call such a pair a Leonard pair on V. Let X denote the set of linear transformations X : V → V such that the matrix representing X with respect to the basis (i) is tridiagonal and the matrix representing X with respect to the basis (ii) is tridiagonal. We show that X is spanned by

     

Games with 1-backtracking

We associate with any game G another game, which is a variant of it, and which we call . Winning strategies for have a lower recursive degree than winning strategies for G: if a player has a winning strategy of recursive degree 1 over G, then it has a recursive winning strategy over , and vice versa. Through we can express in algorithmic form, as a recursive winning strategy, many (but not all) common proofs of non-constructive Mathematics, namely exactly the theorems of the sub-classical logic Limit Computable Mathematics (Hayashi (2006) [6], Hayashi and Nakata (2001) [7]).     

Fractional perfect b-matching polytopes I: General theory

The fractional perfect b-matching polytope of an undirected graph G is the polytope of all assignments of nonnegative real numbers to the edges of G such that the sum of the numbers over all edges incident to any vertex v   is a prescribed nonnegative number _bv$b_v$. General theorems which provide conditions for nonemptiness, give a formula for the dimension, and characterize the vertices, edges and face lattices of such polytopes are obtained. Many of these results are expressed in terms of certain spanning subgraphs of G which are associated with subsets or elements of the polytope. For example, it is shown that an element u of the fractional perfect b-matching polytope of G is a vertex of the polytope if and only if each component of the graph of u either is acyclic or else contains exactly one cycle with that cycle having odd length, where the graph of u is defined to be the spanning subgraph of G whose edges are those at which u is positive.     

Arithmetical complexity of fuzzy predicate logics — A survey II

Results on arithmetical complexity of important sets of formulas of several fuzzy predicate logics (tautologies, satisfiable formulas, …) are surveyed and some new results are proven.     

Expressive completeness through logically tractable models

How can we prove that some fragment of a given logic has the power to define precisely all structural properties that satisfy some characteristic semantic preservation condition? This issue is a fundamental one for classical model theory and applications in non-classical settings alike. While methods differ greatly, and while the classical methods can usually not be matched for instance in the setting of finite model theory, this note surveys some interesting commonality revolving around the use and availability of tractable representatives in the relevant model classes. The construction of models in which simple invariants like partial types based on some weak fragment control all the relevant structural properties, may be seen at the heart of such questions. We highlight some constructions involving degrees of acyclicity and saturation that can be achieved in finite model constructions, and discuss their uses towards expressive completeness w.r.t. bisimulation based equivalences in hypergraphs and relational structures. The emphasis is on the combinatorial challenges in such more constructive approaches that work in non-classical settings and especially in finite model theory. One new result concerns expressive completeness w.r.t. guarded negation bisimulation, a back-and-forth equivalence involving local homomorphisms.     

Subreducts of MV-algebras with product and product residuation

Recently, MV-algebras with product have been investigated from different points of view. In particular, in [EGM01], a variety resulting from the combination of MV-algebras and product algebras (see [H98]) has been introduced. The elements of this variety are called ŁΠ-algebras. In this paper we treat subreducts of ŁΠ-algebras, with emphasis on quasivarieties of subreducts whose basic operations are continuous in the order topology. We give axiomatizations of the most interesting classes of subreducts, and we connect them with other algebraic classes of algebras, like f-rings and Wajsberg hoops, as well as to structures of co-infinitesimals of ŁΠ-algebras. In some cases, connections are given by means of equivalences of categories.Dedicated to the Memory of Wim BlokReceived June 19, 2002; accepted in final form November 29, 2004.This revised version was published online in August 2005 with a corrected cover date.     

Castelnuovo-Mumford regularity by approximation

The Castelnuovo-Mumford regularity of a module gives a rough measure of its complexity. We bound the regularity of a module given a system of approximating modules whose regularities are known. Such approximations can arise naturally for modules constructed by inductive combinatorial means. We apply these methods to bound the regularity of ideals constructed as combinations of linear ideals and the module of derivations of a hyperplane arrangement as well as to give degree bounds for invariants of finite groups.     

Gröbner bases and triangulations of the second hypersimplex

The algebraic technique of Gröbner bases is applied to study triangulations of the second hypersimplex (2,n). We present a quadratic Gröbner basis for the associated toric idealK(K _n ). The simplices in the resulting triangulation of (2,n) have unit volume, and they are indexed by subgraphs which are linear thrackles [28] with respect to a circular embedding ofK _n . Forn6 the number of distinct initial ideals ofI(K _n ) exceeds the number of regular triangulations of (2,n); more precisely, the secondary polytope of (2,n) equals the state polytope ofI(K _n ) forn5 but not forn6. We also construct a non-regular triangulation of (2,n) forn9. We determine an explicit universal Gröbner basis ofI(K _n ) forn8. Potential applications in combinatorial optimization and random generation of graphs are indicated.Research partially supported by a doctoral fellowship of the National University of Mexico, the National Science Foundation, the David and Lucile Packard Foundation and the U.S. Army Research Office (through ACSyAM/MSI, Cornell).