In this paper, the relation between algebraic shifting and join which was conjectured by Eran Nevo will be proved. Let σ and τ be simplicial complexes and σ*τ be their join. Let$J$_{σ}be the exterior face ideal of σ and Δ(σ) the exterior algebraic shifted complex of σ. Assume that σ*τ is a simplicial complex on [$n$]={1,2,...,$n$}. For any$d$-subset$S$⊂[$n$], let $m_{\preceq_{\textrm{rev}}S}(\sigma)$ denote the number of$d$-subsets$R$∈σ which are equal to or smaller than$S$with respect to the reverse lexicographic order. We will prove that $m_{\preceq_{\textrm{rev}}S}(\Delta(\sigma*\tau))\geq m_{\preceq_{\textup{rev}}S}(\Delta(\Delta(\sigma) *\Delta(\tau)))$ for all$S$⊂[$n$]. To prove this fact, we also prove that $m_{\preceq_{\textrm{rev}}S}(\Delta(\sigma))\geq m_{\preceq_{\textup{rev}}S}(\Delta(\Delta_{\varphi}(\sigma)))$ for all$S$⊂[$n$] and for all nonsingular matrices ϕ, where Δ_{ϕ}(σ) is the simplicial complex defined by $J_{\Delta_{\varphi}(\sigma)}=\textup{in}(\varphi(J_{\sigma}))$ .

A computational method, based on l1-minimization, is proposed for the problem of link flow correction, when the available traffic flow data on many links in a road network are inconsistent with respect to the flow conservation law. Without extra information, the problem is generally ill-posed when a large portion of the link sensors are unhealthy. It is possible, however, to correct the corrupted link flows accurately with the proposed method under a recoverability condition if there are only a few bad sensors which are located at certain links. We analytically identify the links that are robust to miscounts and relate them to the geometric structure of the traffic network by introducing the recoverability concept and an algorithm for computing it. The recoverability condition for corrupted links is simply the associated recoverability being greater than 1. In a more realistic setting, besides the unhealthy link sensors, small measurement noises may be present at the other sensors. Under the same recoverability condition, our method guarantees to give an estimated traffic flow fairly close to the ground-truth data and leads to a bound for the correction error. Both synthetic and real-world examples are provided to demonstrate the effectiveness of the proposed method.

We define a notion of formal quantum field theory and associate a formal quantum field theory to K-theoretical intersection theories on Hilbert schemes of points on algebraic surfaces. This enables us to find an effective way to compute K-theoretical intersection theories on Hilbert schemes via a connection to Macdonald polynomials and vertex operators.

No abstract uploaded!

No abstract uploaded!