A characterization of the Grassmann embedding of H(q), with q even

In this note, we characterize the Grassmann embedding of H(q), q even, as the unique full embedding of H(q) in PG(12, q) for which each ideal line of H(q) is contained in a plane. In particular, we show that no such embedding exists for H(q), with q odd. As a corollary, we can classify all full polarized embeddings of H(q) in PG(12, q) with the property that the lines through any point are contained in a solid; they necessarily are Grassmann embeddings of H(q), with q even.     

A note on propositional proof complexity of some Ramsey-type statements

A Ramsey statement denoted ${n \longrightarrow (k)^2_2}$ says that every undirected graph on n vertices contains either a clique or an independent set of size k. Any such valid statement can be encoded into a valid DNF formula RAM(n, k) of size O(n ^k ) and with terms of size ${\left(\begin{smallmatrix}k\\2\end{smallmatrix}\right)}$ . Let r _k be the minimal n for which the statement holds. We prove that RAM(r _k , k) requires exponential size constant depth Frege systems, answering a problem of Krishnamurthy and Moll [15]. As a consequence of Pudlák??s work in bounded arithmetic [19] it is known that there are quasi-polynomial size constant depth Frege proofs of RAM(4 ^k , k), but the proof complexity of these formulas in resolution R or in its extension R(log) is unknown. We define two relativizations of the Ramsey statement that still have quasi-polynomial size constant depth Frege proofs but for which we establish exponential lower bound for R.     

On the conservativity of the axiom of choice over set theory

We show that for various set theories T including ZF, T + AC is conservative over T for sentences of the form ${\forall x \exists ! y}$ A(x, y) where A(x, y) is a ??₀ formula.     

Unitary SK1 of semiramified graded and valued division algebras

We prove formulas for SK₁(E, τ), which is the unitary SK₁ for a graded division algebra E finite-dimensional and semiramified over its center T with respect to a unitary involution τ on E. Every such formula yields a corresponding formula for SK₁(D, ρ) where D is a division algebra tame and semiramified over a Henselian valued field and ρ is a unitary involution on D. For example, it is shown that if ${\sf{E} \sim \sf{I}_0 \otimes_{\sf{T}_0}\sf{N}}$ where I ₀ is a central simple T ₀-algebra split by N ₀ and N is decomposably semiramified with ${\sf{N}_0 \cong L_1\otimes_{\sf{T}_0} L_2}$ with L ₁, L ₂ fields each cyclic Galois over T ₀, then $${\rm SK}_1(\sf{E}, \tau) \,\cong\ {\rm Br}(({L_1}\otimes_{\sf{T}_0} {L_2})/\sf{T}_0;\sf{T}_0^\tau)\big/ \left[{\rm Br}({L_1}/\sf{T}_0;\sf{T}_0^\tau)\cdot {\rm Br}({L_2}/\sf{T}_0;\sf{T}_0^\tau) \cdot \langle[\sf{I}_0]\rangle\right].$$      

Proximity Frames and Regularization

It is well known that the category KHaus of compact Hausdorff spaces is dually equivalent to the category KRFrm of compact regular frames. By de Vries duality, KHaus is also dually equivalent to the category DeV of de Vries algebras, and so DeV is equivalent to KRFrm, where the latter equivalence can be described constructively through Booleanization. Our purpose here is to lift this circle of equivalences and dual equivalences to the setting of stably compact spaces. The dual equivalence of KHaus and KRFrm has a well-known generalization to a dual equivalence of the categories StKSp of stably compact spaces and StKFrm of stably compact frames. Here we give a common generalization of de Vries algebras and stably compact frames we call proximity frames. For the category PrFrm of proximity frames we introduce the notion of regularization that extends that of Booleanization. This yields the category RPrFrm of regular proximity frames. We show there are equivalences and dual equivalences among PrFrm, its subcategories StKFrm and RPrFrm, and StKSp. Restricting to the compact Hausdorff setting, the equivalences and dual equivalences among StKFrm, RPrFrm, and StKSp yield the known ones among KRFrm, DeV, and KHaus. The restriction of PrFrm to this setting provides a new category StrInc whose objects are frames with strong inclusions and whose morphisms and composition are generalizations of those in DeV. Both KRFrm and DeV are subcategories of StrInc that are equivalent to StrInc. For a compact Hausdorff space X, the category StrInc not only contains both the frame of open sets of X and the de Vries algebra of regular open sets of X, these two objects are isomorphic in StrInc, with the second being the regularization of the first. The restrictions of these categories are considered also in the setting of spectral spaces, Stone spaces, and extremally disconnected spaces.     

Locales as spectral spaces

A frame is a complete distributive lattice that satisfies the infinite distributive law ${b \wedge \bigvee_{i \in I} a_i = \bigvee_{i \in I} b \wedge a_i}$ b ∧ ? i ∈ I a i = ? i ∈ I b ∧ a i . The lattice of open sets of a topological space is a frame. The frames form a category Fr. The category of locales is the opposite category Fr ^op . The category BDLat of bounded distributive lattices contains Fr as a subcategory. The category BDLat is anti-equivalent to the category of spectral spaces, Spec (via Stone duality). There is a subcategory of Spec that corresponds to the subcategory Fr under the anti-equivalence. The objects of this subcategory are called locales, the morphisms are the localic maps; the category is denoted by Loc. Thus locales are spectral spaces. The category Loc is equivalent to the category Fr ^op . A topological approach to locales is initiated via the systematic study of locales as spectral spaces. The first task is to characterize the objects and the morphisms of the category Spec that belong to the subcategory Loc. The relationship between the categories Top (topological spaces), Spec and Loc is studied. The notions of localic subspaces and localic points of a locale are introduced and studied. The localic subspaces of a locale X form an inverse frame, which is anti-isomorphic to the assembly associated with the frame of open and quasi-compact subsets of X.     

Boolean topological graphs of semigroups: the lack of first-order axiomatization

The graph of an algebra A is the relational structure G(A) in which the relations are the graphs of the basic operations of A. For a class ?? of algebras let G(??)={G(A)∣A∈??}. Assume that ?? is a class of semigroups possessing a nontrivial member with a neutral element and let ? be the universal Horn class generated by G(??). We prove that the Boolean core of ?, i.e., the topological prevariety generated by finite members of ? equipped with the discrete topology, does not admit a first-order axiomatization relative to the class of all Boolean topological structures in the language of ?. We derive analogous results when ?? is a class of monoids or groups with a nontrivial member.     

A Deterministic O(m \log {m}) Time Algorithm for the Reeb Graph

We present a deterministic algorithm to compute the Reeb graph of a PL real-valued function on a simplicial complex in $O(m \log {m})$ O ( m log m ) time, where $m$ m is the size of the 2-skeleton. The problem can be solved using dynamic graph connectivity. We obtain the running time by using offline graph connectivity which assumes that the deletion time of every arc inserted is known at the time of insertion. The algorithm is implemented and experimental results are given. In addition, we reduce the offline graph connectivity problem to computing the Reeb graph.     

On Morita Equivalence of Partially Ordered Monoids

We show that there is one-to-one correspondence between certain algebraically and categorically defined subobjects, congruences and admissible preorders of S-posets. Using preservation properties of Pos-equivalence functors between Pos-categories we deduce that if S and T are Morita equivalent partially ordered monoids and F:Pos _S →Pos _T is a Pos-equivalence functor then an S-poset A _S and the T-poset F(A _S ) have isomorphic lattices of (regular, downwards closed) subobjects, congruences and admissible preorders. We also prove that if A _S has some flatness property then F(A _S ) has the same property.     

When is the radical associated with a module a torsion?

For an arbitrary R-module M we consider the radical (in the sense of Maranda)G _M, namely, the largest radical among all radicalsG, such thatG(M). We determine necessary and sufficient on M in order for the radicalG(M) to be a torsion. In particular,G(M) is a torsion if and only if M is a pseudo-injective module.     

Semiconic idempotent residuated structures

An idempotent residuated po-monoid is semiconic if it is a subdirect product of algebras in which the monoid identity is comparable with all other elements. It is proved that the quasivariety SCIP of all semiconic idempotent commutative residuated po-monoids is locally finite. The lattice-ordered members of this class form avariety SCIL, which is not locally finite, but it is proved that SCIL has the finite embeddability property (FEP). More generally, for every relative subvariety K of SCIP, the lattice-ordered members of K have the FEP. This gives a unified explanation of the strong finite model property for a range of logical systems. It is also proved that SCIL has continuously many semisimple subvarieties, and that the involutive algebras in SCIL are subdirect products of chains.     

Group homomorphic encryption: characterizations, impossibility results, and applications

We give a complete characterization both in terms of security and design of all currently existing group homomorphic encryption schemes, i.e., existing encryption schemes with a group homomorphic decryption function such as ElGamal and Paillier. To this end, we formalize and identify the basic underlying structure of all existing schemes and say that such schemes are of shift-type. Then, we construct an abstract scheme that represents all shift-type schemes (i.e., every scheme occurs as an instantiation of the abstract scheme) and prove its IND-CCA1 (resp. IND-CPA) security equivalent to the hardness of an abstract problem called Splitting Oracle-Assisted Subgroup Membership Problem (SOAP) (resp. Subgroup Membership Problem, SMP). Roughly, SOAP asks for solving an SMP instance, i.e., for deciding whether a given ciphertext is an encryption of the neutral element of the ciphertext group, while allowing access to a certain oracle beforehand. Our results allow for contributing to a variety of open problems such as the IND-CCA1 security of Paillier’s scheme, or the use of linear codes in group homomorphic encryption. Furthermore, we design a new cryptosystem which provides features that are unique up to now: Its IND-CPA security is based on the k-linear problem introduced by Shacham, and Hofheinz and Kiltz, while its IND-CCA1 security is based on a new k-problem that we prove to have the same progressive property, namely that if the k-instance is easy in the generic group model, the (k+1)-instance is still hard.     

A Classification of Graphs Whose Subdivision Graph is Locally Distance Transitive

The subdivision graph S(Σ) of a connected graph Σ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs Σ such that S(Σ) is locally (G, s)-distance transitive for s ≤ 2 diam(Σ) ? 1 and some G?≤ Aut(Σ). In this paper, we solve the remaining cases by classifying all the graphs Σ such that S(Σ) is locally (G, s)-distance transitive for some s?≥ 2 diam(Σ) and some G?≤ Aut(Σ). As a corollary, we get a classification of all the graphs whose subdivision graph is locally distance transitive.     

Continuous maximal regularity on uniformly regular Riemannian manifolds

We establish continuous maximal regularity results for parabolic differential operators acting on sections of tensor bundles on uniformly regular Riemannian manifolds M. As an application, we show that solutions to the Yamabe flow on M instantaneously regularize and become real analytic in space and time. The regularity result is obtained by introducing a family of parameter-dependent diffeomorphisms acting on functions on M in conjunction with maximal regularity and the implicit function theorem.     

E-local pseudovarieties

Generalizing a property of the pseudovariety of all aperiodic semigroups observed by Tilson, we call E -local a pseudovariety V which satisfies the following property: for a finite semigroup, the subsemigroup generated by its idempotents belongs to V if and only if so do the subsemigroups generated by the idempotents in each of its regular $\mathcal{D}$ -classes. In this paper, we present several sufficient or necessary conditions for a pseudovariety to be E-local or for a pseudoidentity to define an E-local pseudovariety. We also determine several examples of the smallest E-local pseudovariety containing a given pseudovariety.     

A formally Kähler structure on a knot space of a G 2-manifold

A knot space in a manifold M is a space of oriented immersions ${S^{1} \hookrightarrow M}$ up to Diff(S ¹). J.-L. Brylinski has shown that a knot space of a Riemannian threefold is formally Kähler. We prove that a space of knots in a holonomy G ₂ manifold is formally Kähler.     

The maximal linear extension theorem in second order arithmetic

We show that the maximal linear extension theorem for well partial orders is equivalent over RCA ₀ to ATR ₀. Analogously, the maximal chain theorem for well partial orders is equivalent to ATR ₀ over RCA ₀.     

On predicate provability logics and binumerations of fragments of Peano arithmetic

Solovay proved (Israel J Math 25(3–4):287–304, 1976) that the propositional provability logic of any ∑₂-sound recursively enumerable extension of PA is characterized by the propositional modal logic GL. By contrast, Montagna proved in (Notre Dame J Form Log 25(2):179–189, 1984) that predicate provability logics of Peano arithmetic and Bernays–Gödel set theory are different. Moreover, Artemov proved in (Doklady Akademii Nauk SSSR 290(6):1289–1292, 1986) that the predicate provability logic of a theory essentially depends on the choice of a binumeration of the theory which is used to construct the provability predicate. In this paper, we compare predicate provability logics of I∑ _n ’s. For a binumeration α(x) of a recursive theory T, let PL _α(T) be the predicate provability logic of T defined by α(x). We prove that for any natural numbers i, j such that 0 < i < j, there exists a ∑₁ binumeration α(x) of some recursive axiomatization of I∑ _i such that ${{\sf PL}_\alpha({\rm I \Sigma}_i) \nsupseteq \bigcap_{\beta(x)}{\sf PL}_\beta({\rm I \Sigma}_j)}$ PL α ( I Σ i ) ? ? β ( x ) PL β ( I Σ j ) and ${{\sf PL}_\alpha({\rm I \Sigma}_i) \nsubseteq \bigcup_{\beta(x)}{\sf PL}_\beta({\rm I \Sigma}_j)}$ PL α ( I Σ i ) ? ? β ( x ) PL β ( I Σ j ) , where β(x) ranges over all ∑₁ binumerations of recursive axiomatizations of I∑ _j .     

Twisted split category algebras as quasi-hereditary algebras

We show that if C is a finite split category, k is a field of characteristic 0, and α is a 2-cocycle of C with values in k  ^× , then the twisted category algebra k _α C is quasi-hereditary.     

Convolutions of random measures on compact groups

LetG be a compact group andM ₁(G) be the convolution semigroup of all Borel probability measures onG with the weak topology. We consider a stationary sequence {μ _n } _n=?∞ ^+∞ of random measures μ _n =μ _n (ω) inM ₁(G) and the convolutions $$v_{m,n} (\omega ) = \mu _m (\omega )* \cdots *\mu _{n - 1} (\omega ), m< n$$ and $$\alpha _n^{( + k)} (\omega ) = \frac{1}{k}\sum\limits_{i = 1}^k {v_{n,n + i} (\omega ),} \alpha _n^{( - k)} (\omega ) = \frac{1}{k}\sum\limits_{i = 1}^k {v_{n - i,n} (\omega )} $$ We describe the setsA _m ⁺ (ω) andA _n ⁺ (ω) of all limit points ofv _m,n(ω) asm→?∞ orn→+∞ and the setA _∞(ω) of its two-sided limit points for typical realizations of {μ _n (ω)} _n=?∞ ^+∞ . Using an appropriate random ergodic theorem we study the limit random measures ρ _n ^(±) (ω)=lim _k→∞ α _n ^(±k) (ω).