Corrigendum to: “Clifford Theory of a Finite Group that Contains a Defect 0 p-Block of a Normal Subgroup”

At some point, after publication, the author realized that the proof of [3 Harris, M. E. (2013). Clifford theory of a finite group that contains a defect 0 p-block of a normal subgroup. Comm. in Alg. 41:3509–3540.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar], Theorem 5.2] is incorrect. This proof incorrectly adapts the proof of [1 Broué, M. (1990). Isométries parfaites, types de blocs, cégories dérivees. Aérisque 181–182:61–92. [Google Scholar], Theorem 4.8] since [3 Harris, M. E. (2013). Clifford theory of a finite group that contains a defect 0 p-block of a normal subgroup. Comm. in Alg. 41:3509–3540.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar], (5.5)] is incorrect. Using the same proof outline, we correct the proof of [3 Harris, M. E. (2013). Clifford theory of a finite group that contains a defect 0 p-block of a normal subgroup. Comm. in Alg. 41:3509–3540.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar], Theorem 5.2].     

On Preservation Theorems for Two-Variable Logic

We show that the existential preservation theorem fails for two-variable first-order logic FO². It is known that for all k ≥ 3, FO^k does not have an existential preservation theorem, so this settles the last open case, answering a question of Andreka, van Benthem, and Németi. In contrast, we prove that the homomorphism preservation theorem holds for FO².     

Canonizing structural Ramsey theorems

At the beginning of 1950s Erd?s and Rado suggested the investigation of the Ramsey-type results where the number of colors is not finite. This marked the birth of the so-called canonizing Ramsey theory. In 1985 Prömel and Voigt made the first step towards the structural canonizing Ramsey theory when they proved the canonical Ramsey property for the class of finite linearly ordered hypergraphs, and the subclasses thereof defined by forbidden substructures. Building on their results in this paper we provide several new structural canonical Ramsey results. We prove the canonical Ramsey theorem for the class of all finite linearly ordered tournaments, the class of all finite posets with linear extensions and the class of all finite linearly ordered metric spaces. We conclude the paper with the canonical version of the celebrated Ne?et?il–Rödl Theorem. In contrast to the “classical” Ramsey-theoretic approach, in this paper we advocate the use of category theory to manage the complexity of otherwise technically overwhelming proofs typical in canonical Ramsey theory.     

Maximal caps in AG (6, 3)

We show that there are no complete 44-caps in AG(5, 3). We then use this result to prove that the maximal size for a cap in AG(6, 3) is equal to 112, and that the 112-caps in AG(6, 3) are unique up to affine equivalence.      

A theory of sets with the negation of the axiom of infinity

In this paper we introduce a theory of finite sets FST with a strong negation of the axiom of infinity asserting that every set is provably bijective with a natural number. We study in detail the role of the axioms of Power Set, Choice, Regularity in FST, pointing out the relative dependences or independences among them. FST is shown to be provably equivalent to a fragment of Alternative Set Theory. Furthermore, the introduction of FST is motivated in view of a non-standard development. MSC: 03E30, 03E35.     

Direct Ramsey theorem for structures involving relations and functions

We prove the direct structural Ramsey theorem for structures with relations as well as functions. The result extends the theorem of Abramson and Harrington and of Nešet?il and Rödl.     

Finite Block Theory and Hopf Algebra Actions

A ring is said to have finite block theory if it can be written as the finite direct sum of indecomposable subrings. In the paper, algebras R are acted on by Hopf algebras H. We prove a series of going up and going down results analyzing when R and its subalgebra of invariants R ^H have finite block theory. We also provide counterexamples when the hypotheses of our main results are weakened. Presented by D. Passman     

Corrigendum to “Toric codes and finite geometries” [Finite Fields Appl. 45 (2017) 203–216]

This correction adds a necessary hypothesis in Proposition 2.4 of [1]. A counterexample to the previous version was pointed out to the author by Melda Görür and the author thanks her for bringing that to his attention. Theorem 3.2 and Corollary 3.3 are also reformulated so they do not refer to the new, more restricted Proposition 2.4.     

Average fill rate and horizon length

Given a sequence of independent and identically distributed demands and an order up to replenishment policy with negligible lead time, we prove that average fill rate is monotonically decreasing in the number of periods in the planning horizon. This was conjectured to be true in a recent issue of this journal.     

Finite difference schemes of the nonlinear pseudo-parabolic system

ＦＩＮＩＴＥＤＩＦＦＥＲＥＮＣＥＳＣＨＥＭＥＳＯＦＴＨＥＮＯＮＬＩＮＥＡＲＰＳＥＵＤＯ－ＰＡＲＡＢＯＬＩＣＳＹＳＴＥＭＤＵＭＩＮＧＳＨＥＮＧ（杜明笙）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＰｈｙｓｉｃｓａｎｄＣｏｍｐｕｔａｔｉｏｎａｌＭａｔｈｅｍａｔ...     

Tarski's finite basis problem via

R. McKenzie has recently associated to each Turing machine a finite algebra having some remarkable properties. We add to the list of properties, by proving that the equational theory of is finitely axiomatizable if halts on the empty input. This completes an alternate (and simpler) proof of McKenzie's negative answer to A. Tarski's finite basis problem. It also removes the possibility, raised by McKenzie, of using to answer an old question of B. Jónsson.

     

A Characterization of Finitely Decidable Congruence Modular Varieties

For every finitely generated, congruence modular variety of finite type we find a finite family of finite rings such that the variety is finitely decidable if and only if is congruence permutable and residually small, all solvable congruences in finite algebras from are Abelian, each congruence above the centralizer of the monolith of a subdirectly irreducible algebra from is comparable with all congruences of , each homomorphic image of a subdirectly irreducible algebra with a non-Abelian monolith has a non-Abelian monolith, and, for each ring from , the variety of -modules is finitely decidable.

     

A hierarchy of hereditarily finite sets

This article defines a hierarchy on the hereditarily finite sets which reflects the way sets are built up from the empty set by repeated adjunction, the addition to an already existing set of a single new element drawn from the already existing sets. The structure of the lowest levels of this hierarchy is examined, and some results are obtained about the cardinalities of levels of the hierarchy.      

Multiple-scale analysis of dynamical systems on the lattice

We propose a new approach to the multiple-scale analysis of difference equations, in the context of the finite operator calculus. We derive the transformation formulae that map any given dynamical system, continuous or discrete, into a rescaled discrete system, by generalizing a classical result due to Jordan. Under suitable analytical hypotheses on the function space we consider, the rescaled equations are of finite order. Our results are applied to the study of multiple-scale reductions of dynamical systems, and in particular to the case of a discrete nonlinear harmonic oscillator.     

Elementary Properties of the Finite Ranks

This note investigates the class of finite initial segments of the cumulative hierarchy of pure sets. We show that this class is first-order definable over the class of finite directed graphs and that this class admits a first-order definable global linear order. We apply this last result to show that FO(<, BIT) = FO(BIT).     

On Representing Concepts in Finite Models

We present a method of transferring Tarski's technique of classifying finite order concepts by means of truth‐definitions into finite mode theory. The other considered question is the problem of representability relations on words or natural numbers in finite models. We prove that relations representable in finite models are exactly those which are of degree ≤ o′. Finally, we consider theories of sufficiently large finite models. For a given theory T we define sl(T) as the set of all sentences true in almost all finite models for T. For theories of sufficiently large models our version of Tarski's technique becomes practically the same as the classica one. We investigate also degrees of undecidability for theories of sufficiently large finite models. We prove for some special theory ST that its degree is stronger than 0′ but still not more than Σ⁰₂.