Related papers: Formal construction of some exchangeable structure…

The Poisson structures for 3D systems possessing one constant of motion can always be constructed from the solution of a linear PDE. When two constants of the motion are available the problem reduces to a quadrature and the structure…

In this, largely expository, note, we show how the simplicial structure of the moduli spaces of stable rational curves with marked points allows to produce explicit equations for these spaces. The key argument is an elementary combinatorial…

In the field of the Jacobian conjecture it is well-known after Druzkowski that from a polynomial "cubic-homogeneous" mapping we can build a higher-dimensional "cubic-linear" mapping and the other way round, so that one of them is invertible…

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based…

This article discuss a class of tractable model in the form of polynomial type.

This paper is a continuation of our previous works where we study maps from $X_0(N)$, $N \ge 1$, into $\mathbb P^2$ constructed via modular forms of the same weight and criteria that such a map is birational (see [12]). In the present paper…

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

Mekler's construction is a powerful technique for building purely algebraic structures from combinatorial ones. Its power lies in the fact that it allows various model-theoretic tameness properties of the combinatorial structure to transfer…

A poset is Macaulay if its partial order and an additional total order interact well. Analogously, a ring is Macaulay if the partial order defined on its monomials by division interacts nicely with any total monomial order. We investigate…

We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…

This is a review of the authors' recent results on an integrable structure of the melting crystal model with external potentials. The partition function of this model is a sum over all plane partitions (3D Young diagrams). By the method of…

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

We discuss the nature of structure and organization, and the process of making new Things. Hyperstructures are introduced as binding and organizing principles, and we show how they can transfer from one situation to another. A guiding…

This article is first in a series of papers where we reprove the statements in constructing the Enhanced Operation Map and the abstract six-functor formalism developed by Liu-Zheng. In this paper, we prove a theorem regarding constructing…

We introduce a direct image formalism for constructible motivic functions. One deduces a very general version of motivic integration for which a change of variables theorem is proved. These constructions are generalized to the relative…

Let $M$ be a compact hyperkaehler manifold. The hyperkaehler structure equips $M$ with a set $R$ of complex structures parametrized by $CP^1$, called "the set of induced complex structures". It was known previously that induced complex…

We consider the multiplicative structure of sets of the form AA+1, where where A is a large, finite set of real numbers. In particular, we show that the additively shifted product set, AA+1 must have a large part outside of any generalized…

We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…