Lifting inequalities for polytopes

We present a method of lifting linear inequalities for the flag f-vector of polytopes to higher dimensions. Known inequalities that can be lifted using this technique are the non-negativity of the toric g-vector and that the simplex minimizes the cd-index. We obtain new inequalities for six-dimensional polytopes. In the last section we present the currently best known inequalities for dimensions 5 through 8.     

Small Chvátal Rank

We propose a variant of the Chvátal-Gomory procedure that will produce a sufficient set of facet normals for the integer hulls of all polyhedra {x : A x ≤ b} as b varies. The number of steps needed is called the small Chvátal rank (SCR) of A. We characterize matrices for which SCR is zero via the notion of supernormality which generalizes unimodularity. SCR is studied in the context of the stable set problem in a graph, and we show that many of the well-known facet normals of the stable set polytope appear in at most two rounds of our procedure. Our results reveal a uniform hypercyclic structure behind the normals of many complicated facet inequalities in the literature for the stable set polytope. Lower bounds for SCR are derived both in general and for polytopes in the unit cube.     

Regular principal factors in free objects in varieties in the interval [B 2 ,NB 2 ∨G n ]

The author has shown previously how to associate a completely 0-simple semigroup with a connected bipartite graph containing labelled edges and how to describe the regular principal factors in the free objects in the Rees-Sushkevich varieties RS _n generated by all completely 0-simple semigroups over groups from the Burnside variety G _n of groups of exponent dividing a positive integer n by employing this graphical construction. Here we consider the analogous problem for varieties containing the variety B ₂ , generated by the five element Brandt semigroup B ₂, and contained in the variety NB ₂ ∨G _n where NB ₂ is the variety generated by all left and right zero semigroups together with B ₂. The interval [NB ₂ ,NB ₂ ∨G _n ] is of particular interest as it is an important interval, consisting entirely of varieties generated by completely 0-simple semigroups, in the lattice of subvarieties of RS _n .     

Analysis of Basis Pursuit via Capacity Sets

Finding the sparsest solution α for an under-determined linear system of equations D α=s is of interest in many applications. This problem is known to be NP-hard. Recent work studied conditions on the support size of α that allow its recovery using ? ₁-minimization, via the Basis Pursuit algorithm. These conditions are often relying on a scalar property of D called the mutual-coherence. In this work we introduce an alternative set of features of an arbitrarily given D, called the capacity sets. We show how those could be used to analyze the performance of the basis pursuit, leading to improved bounds and predictions of performance. Both theoretical and numerical methods are presented, all using the capacity values, and shown to lead to improved assessments of the basis pursuit success in finding the sparest solution of D α=s.     

Properties of vertex packing and independence system polyhedra

We consider two convex polyhedra related to the vertex packing problem for a finite, undirected, loopless graphG with no multiple edges. A characterization is given for the extreme points of the polyhedron \(\mathcal{L}_G = \{ x \in R^n :Ax \leqslant 1_m ,x \geqslant 0\} \) , whereA is them × n edge-vertex incidence matrix ofG and 1 _m is anm-vector of ones. A general class of facets of = convex hull{x∈R ⁿ :Ax≤1 _m ,x binary} is described which subsumes a class examined by Padberg [13]. Some of the results for are extended to a more general class of integer polyhedra obtained from independence systems.     

Linear maps preserving M–P inverses of matrices between matrix spaces over fields

Suppose F is a field of characteristic not 2. Let n and m be two arbitrary positive integers with n≥2. We denote by M _n (F) and S _n (F) the space of n×n full matrices and the space of n×n symmetric matrices over F, respectively. All linear maps from S _n (F) to M _m (F) preserving M–P inverses of matrices are characterized first, and thereby all linear maps from S _n (F) (M _n (F)) to S _m (F) (M _m (F)) preserving M–P inverses of matrices are characterized, respectively.     

The Discrepancy of the Sequence (nα + (log n)β)

In this paper we give an upper bound for the discrepancy of the sequence (nα + (log n)β) where α = (α₁, ..., α _s ) R ^s , which satisfies that 1, α₁, ..., α _s are linearly independent over Z, is of finite type η or is of constant type.     

Measurable events indexed by products of trees

A tree T is said to be homogeneous if it is uniquely rooted and there exists an integer b ≥ 2, called the branching number of T, such that every t ∈ T has exactly b immediate successors. A vector homogeneous tree T is a finite sequence (T ₁,...,T _d ) of homogeneous trees and its level product ?T is the subset of the Cartesian product T ₁×...×T _d consisting of all finite sequences (t ₁,...,t _d ) of nodes having common length. We study the behavior of measurable events in probability spaces indexed by the level product ?T of a vector homogeneous tree T. We show that, by refining the index set to the level product ?S of a vector strong subtree S of T, such families of events become highly correlated. An analogue of Lebesgue’s density Theorem is also established which can be considered as the “probabilistic” version of the density Halpern-Läuchli Theorem.     

On Dirichlet Type Problems of Polynomial Dirac Equations with Boundary Conditions

Let ${{\bf D}_{\bf x} := \sum_{i=1}^n \frac{\partial}{\partial x_i} e_i}$ be the Euclidean Dirac operator in ${\mathbb{R}^n}$ and let P(X) = a _m X ^m + . . . + a ₁ X +  a ₀ be a polynomial with real coefficients. Differential equations of the form P(D _x )u(x) = 0 are called homogeneous polynomial Dirac equations with real coefficients. In this paper we treat Dirichlet type problems of the a slightly less general form P(D _x )u(x) = f(x) (where the roots are exclusively real) with prescribed boundary conditions that avoid blow-ups inside the domain. We set up analytic representation formulas for the solutions in terms of hypercomplex integral operators and give exact formulas for the integral kernels in the particular cases dealing with spherical and concentric annular domains. The Maxwell and the Klein–Gordon equation are included as special subcases in this context.     

Two remarks on normality preserving Borel automorphisms of \boldsymbol{\mathbb{R}{\kern-8.3pt}\mathbb{R}}^{{\bf \textit{n}}}

Let T be a bijective map on ? ⁿ such that both T and T ^???1 are Borel measurable. For any θ?∈?? ⁿ and any real n ×n positive definite matrix Σ, let N (θ, Σ) denote the n-variate normal (Gaussian) probability measure on ? ⁿ with mean vector θ and covariance matrix Σ. Here we prove the following two results: (1) Suppose $N(\boldsymbol{\theta}_j, I)T^{-1}$ is gaussian for 0?≤?j?≤?n, where I is the identity matrix and {θ _j ???θ ₀, 1?≤?j?≤?n } is a basis for ? ⁿ . Then T is an affine linear transformation; (2) Let $\Sigma_j = I + \varepsilon_j \mathbf{u}_j \mathbf{u}_j^{\prime},$ 1?≤?j?≤?n where ε _j ?>???1 for every j and {u _j , 1?≤?j?≤?n } is a basis of unit vectors in ? ⁿ with $\mathbf{u}_j^{\prime}$ denoting the transpose of the column vector u _j . Suppose N(0, I)T ^???1 and $N (\mathbf{0}, \Sigma_j)T^{-1},$ 1?≤?j?≤?n are gaussian. Then $T(\mathbf{x}) = \sum\nolimits_{\mathbf{s}} 1_{E_{\mathbf{s}}}(\mathbf{x}) V \mathbf{s} U \mathbf{x}$ a.e. x, where s runs over the set of 2 ⁿ diagonal matrices of order n with diagonal entries ±1, U, V are n ×n orthogonal matrices and { E _s } is a collection of 2 ⁿ Borel subsets of ? ⁿ such that { E _s } and {V s U (E _s )} are partitions of ? ⁿ modulo Lebesgue-null sets and for every j, $V \mathbf{s} U \Sigma_j (V \mathbf{s} U)^{-1}$ is independent of all s for which the Lebesgue measure of E _s is positive. The converse of this result also holds. Our results constitute a sharpening of the results of Nabeya and Kariya (J. Multivariate Anal. 20 (1986) 251–264) and part of Khatri (Sankhyā Ser. A 49 (1987) 395–404).     

Δ2 degrees without Σ1 induction

In this paper, we study the structure of Turing degrees below 0′ in the theory that is a fragment of Peano arithmetic without Σ₁ induction, with special focus on proper d-r.e. degrees and non-r.e. degrees. We prove:

1. P ^? + BΣ₁ + Exp ? There is a proper d-r.e. degree.
2. P ^? +BΣ₁+ Exp ? IΣ₁ ? There is a proper d-r.e. degree below 0′.
3. P ^? + BΣ₁ + Exp ? There is a non-r.e. degree below 0′.

     

On rings whose number of centralizers of ideals is finite

LetR be a ring. For the setF of all nonzero ideals ofR, we introduce an equivalence relation inF as follows: For idealsI andJ, I～J if and only ifV _R (I)=V _R(J), whereV _R() is the centralizer inR. LetI _R=F/～. Then we can see thatn(I _R), the cardinality ofI _R, is 1 if and only ifR is either a prime ring or a commutative ring (Theorem 1.1). An idealI ofR is said to be a commutator ideal ifI is generated by{st?ts; s∈S, t∈T} for subsetS andT ofR, andR is said to be a ring with (N) if any commutator ideal contains no nonzero nilpotent ideals. Then we have the following main theorem: LetR be a ring with (N). Thenn(I _R) is finite if and only ifR is isomorphic to an irredundant subdirect sum ofS⊕Z whereS is a finite direct sum of non commutative prime rings andZ is a commutative ring (Theorem 2.1). Finally, we show that the existence of a ringR such thatn(I _R)=m for any given natural numberm.     

Characterization and Connectivity of Generalized Filters in L 2(ℝ d )

Let A be a d×d real expansive integer matrix (i.e., a matrix with real entries whose eigenvalues are all of modules greater than one) with |det?A|=2, and let m (which is called A-dilation generalized filter) be a 2π? ^d periodic function with the property that |m(s)|²+|m(s+2π h ₂)|²=1, where h ₂∈(A ^τ )^?1? ^d ?? ^d . In this paper, we characterize the set of all A-dilation generalized filters and show that this set is path-connected in $L^{2}({\mathbb{T}}^{d})$ -norm by using the technique of filter multipliers. We also obtain an equivalent condition for an A-dilation generalized filter to be an A-dilation low pass filter. These extend the results of Manos Papadakis et al. from one dimensional case to high dimensions and matrix dilations cases.     

On diversity and stability of unit bases for the Euclidean metric

We prove the existence of a family Ω(n) of 2 ^c (where c is the cardinality of the continuum) subgraphs of the unit distance graph (E ⁿ , 1) of the Euclidean space E ⁿ , n ≥ 2, such that (a) for each graph G ? Ω(n), any homomorphism of G to (E ⁿ , 1) is an isometry of E ⁿ ; moreover, for each subgraph G ₀ of the graph G obtained from G by deleting less than c vertices, less than c stars, and less than c edges (we call such a subgraph reduced), any homomorphism of G ₀ to (E ⁿ , 1) is an isometry (of the set of the vertices of G ₀); (b) each graph G ? Ω(n) cannot be homomorphically mapped to any other graph of the family Ω(n), and the same is true for each reduced subgraph of G.     

L p -Norms, Log-Barriers and Cramer Transform in Optimization

We show that the Laplace approximation of a supremum by L ^p -norms has interesting consequences in optimization. For instance, the logarithmic barrier functions (LBF) of a primal convex problem P and its dual P ^* appear naturally when using this simple approximation technique for the value function g of P or its Legendre–Fenchel conjugate g ^*. In addition, minimizing the LBF of the dual P ^* is just evaluating the Cramer transform of the Laplace approximation of g. Finally, this technique permits to sometimes define an explicit dual problem P ^* in cases when the Legendre–Fenchel conjugate g ^* cannot be derived explicitly from its definition.     

Non-conformal Repellers and the Continuity of Pressure for Matrix Cocycles

The pressure function P(A, s) plays a fundamental role in the calculation of the dimension of “typical” self-affine sets, where A = (A ₁, …,A _k ) is the family of linear mappings in the corresponding generating iterated function system. We prove that this function depends continuously on A. As a consequence, we show that the dimension of “typical” self-affine sets is a continuous function of the defining maps. This resolves a folklore open problem in the community of fractal geometry. Furthermore we extend the continuity result to more general sub-additive pressure functions generated by the norm of matrix products or generalized singular value functions for matrix cocycles, and obtain applications on the continuity of equilibrium measures and the Lyapunov spectrum of matrix cocycles.