Related papers: Notes on Laver Tables

To present a survey on known results from the theory of transposed Poisson algebras, as well as to establish new results on this subject, are the main aims of the present paper. Furthermore, a list of open questions for future research is…

This paper gives an overview of some basic properties of Leibniz algebras. Some of the results were known earlier, but in the article they are accompanied by new simple proofs. Some of the results are new. The article can be viewed as a…

We introduce the the fractional Laplacian on a subgraph of a graph with Dirichlet boundary condition. For a lattice graph, we prove the upper and lower estimates for the sum of the first $k$ Dirichlet eigenvalues of the fractional…

In this short note we improve the best to date bound in Godbersen's conjecture, and show some implications for unbalanced difference bodies.

In this paper, we derive an optimal first-order Taylor-like formula. In a seminal paper [14], we introduced a new first-order Taylor-like formula that yields a reduced remainder compared to the classical Taylor's formula. Here, we relax the…

We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.

We study a new model theory for formal mathematical systems that we developed in a previous paper. We introduce isomorphic and homomorphic structures for formal languages, present some results and examples and conclude our paper with a…

The best known method to give a lower bound for the Noether number of a given finite group is to use the fact that it is greater than or equal to the Noether number of any of the subgroups or factor groups. The results of the present paper…

We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.

In this note we describe some results concerning upper and lower bounds for the Jensen functional. We use several known and new results to shed light on the concepts of superterzatic functions.

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

A new understanding of the notion of regularizer is proposed. It is argued that this new notion is more realistic than the old one and better fits the practical computational needs. An example of the regularizer in the new sense is given. A…

The article focuses on the problems of prime gaps and zero spacings. Possible solutions of several related problems such as the greatest lower bound, the least upper bound of the zero spacings, and the least upper bound of the prime gaps…

After a short review of the Method of Recursive Counting we introduce a general algebraic description of recursive lattice building. This provides a rigorous framework for discussion of method's limitations.

We obtain new lower and upper bounds for probabilities of unions of events.These bounds are sharp. They are stronger than earlier ones. General bounds maybe applied in arbitrary measurable spaces.We have improved the method that has been…

I give a short overview of Chiral Perturbation Theory, its underlying assumptions and underpinnings. A few examples are included.

In this paper, we present some multi-dimensional central limit theorems and laws of large numbers under sublinear expectations, which extend some previous results.

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

These supplementary notes in the ArXiv are a companion to our paper "Bocher contractions of conformally superintegrable Laplace equations" [arXiv:1512.09315]. They contain background material and the details of the extensive computations…

We improve some upper bounds for minimal dispersion on the cube and torus. /Our new ingredient is an improvement of a probabilistic lemma used to obtain upper bounds for dispersion in several previous works. Our new lemma combines a random…