Related papers: Un Crit{\`E}Re Simple
In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on…
The concepts of amenable and compatible functions have been introduced in a recent work, in order to state precise mathematical theorems that guarantee that a backward stable algorithm is also forward stable, and that the composition of two…
We lay the groundwork for a formal framework that studies scientific theories and can serve as a unified foundation for the different theories within physics. We define a scientific theory as a set of verifiable statements, assertions that…
We show that the classification of simple finite group schemes over an algebraically closed field reduces to the classification of abstract simple finite groups and of simple restricted Lie algebras in positive characteristic. Both these…
We prove that a finite von Neumann algebra ${\mathcal A}$ is semisimple if the algebra of affiliated operators ${\mathcal U}$ of ${\mathcal A}$ is semisimple. When ${\mathcal A}$ is not semisimple, we give the upper and lower bounds for the…
The perturbation theory based on typicality introduced in Ref. [1] and further refined in Refs. [2, 3] provides a powerful tool since it is intended to be applicable to a wide range of scenarios while relying only on a few parameters. Even…
We define the notion of a multi-sorted algebraic theory, which is a generalization of an algebraic theory in which the objects are of different "sorts." We prove a rigidification result for simplicial algebras over these theories, showing…
A new attempt is demonstrated that QFTs can be UV finite if they are viewed as the low energy effective theories of a fundamental underlying theory (that is complete and well-defined in all respects) according to the modern standard point…
A theory is NIP (resp. stable) if and only if every formula with parameters in two single variables is NIP (resp. does not have the order property).
Following a research line proposed by Hrushovski in his work on pseudofinite fields with an additive character, we investigate the theory $\mathrm{ACFA}^{+}$ which is the model companion of the theory of difference fields with an additive…
One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…
We describe certain almost-simple algebraic supergroups over an algebraically closed field of odd or zero characteristic. In addition to supergroups with simple Lie superalgebras from Kac's theorem, we construct new supergroups whose Lie…
In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…
We introduce an operator on classes of regular languages, the star-free closure. Our motivation is to generalize standard results of automata theory within a unified framework. Given an arbitrary input class $C$, the star-free closure…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses…
We prove that the $\Phi^4$ theory is trivial for any values of the bare coupling constant $\lambda$ thus extending previous results referring to very strong couplings to the full range of values for this parameter. The method is based on…
We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…