English
Related papers

Related papers: Studies in Additive Number Theory by Circles of Pa…

200 papers

We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all, we show that the framework is indeed applicable to those…

Logic in Computer Science · Computer Science 2022-04-29 Ugo Dal Lago , Furio Honsell , Marina Lenisa , Paolo Pistone

Suppose we wish to embed an (associative) $k$-algebra $A$ in a $k$-algebra $R$ generated in some specified way; e.g., by two elements, or by copies of given $k$-algebras $A_1,$ $A_2,$ $A_3.$ Several authors have obtained sufficient…

Rings and Algebras · Mathematics 2020-11-04 George M. Bergman

We introduce a class of stochastic processes with reinforcement consisting of a sequence of random partitions $\{\mathcal{P}_t\}_{t \ge 1}$, where $\mathcal{P}_t$ is a partition of $\{1,2,\dots, Rt\}$. At each time~$t$,~$R$ numbers are…

Probability · Mathematics 2021-03-02 Caio Alves , Rodrigo Ribeiro , Daniel Valesin

Recently, many authors have investigated how various partition statistics distribute as the size of the partition grows. In this work, we look at a particular statistic arising from the recent rejuvenation of MacMahon's partition analysis.…

Combinatorics · Mathematics 2025-03-17 William Craig , Runqiao Li

We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…

Combinatorics · Mathematics 2016-08-19 Robert Coquereaux , Jean-Bernard Zuber

This paper is a summary of the theory of discrete embeddings introduced in [5]. A discrete embedding is an algebraic procedure associating a numerical scheme to a given ordinary differential equation. Lagrangian systems possess a…

Numerical Analysis · Mathematics 2016-01-20 Loïc Bourdin , Jacky Cresson , Isabelle Greff , Pierre Inizan

By means of topological methods, we provide new results on the existence, non-existence, localization and multiplicity of nontrivial solutions for systems of perturbed Hammerstein integral equations. In order to illustrate our theoretical…

Classical Analysis and ODEs · Mathematics 2016-08-30 Filomena Cianciaruso , Gennaro Infante , Paolamaria Pietramala

Similarly to the derivation of the Gibbs-Boltzmann distribution for structureless indistinguishable particles, we consider multi-particle systems some of which are contained (or delimited) inside others (Problem 1), as well as systems of…

Statistical Mechanics · Physics 2021-07-19 Michael Romanovsky

The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…

General Topology · Mathematics 2024-12-30 Denis I. Saveliev

We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…

Commutative Algebra · Mathematics 2008-06-04 Kei-ichiro Iima , Yuji Yoshino

The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…

Combinatorics · Mathematics 2025-06-03 Arkabrata Ghosh , Sayan Goswami , Sourav Kanti Patra

We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…

Dynamical Systems · Mathematics 2012-12-07 Artur Siemaszko , Maciej P. Wojtkowski

In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…

Combinatorics · Mathematics 2020-06-05 Beáta Bényi , Miguel Méndez , José L. Ramirez

We introduce a notion of embedding codimension of an arbitrary local ring, establish some general properties, and study in detail the case of arc spaces of schemes of finite type over a field. Viewing the embedding codimension as a measure…

Algebraic Geometry · Mathematics 2022-07-06 Christopher Chiu , Tommaso de Fernex , Roi Docampo

We study the combinatorial and structural properties of the circle map sequences. We introduce an embedding procedure which gives a map from the hull(closure of the set of translates) to the sequence of embedding operations through which we…

Combinatorics · Mathematics 2009-02-04 Fumihiko Nakano

We use spectral theory to produce embeddings of distributions in the algebras of generalized functions on a closed Riemannian manifold. These embeddings are invariant under isometries and preserve the singularity structure of the…

Analysis of PDEs · Mathematics 2007-09-14 Shantanu Dave

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

Algebraic Geometry · Mathematics 2015-09-22 Saugata Basu , Martin Sombra

In this paper, we calculate an exact formula for the number of partitions of a natural number $n$, where the largest part is even and no odd parts appears more than two times. The generating functions of the number of these partitions is a…

Number Theory · Mathematics 2026-04-21 Kilian Rausch

A criterion for determining exactly when an order of a maximal subfield of a central simple algebra over a number field can be embedded into an order of this algebra is given. Various previous results have been generalized and recovered by…

Number Theory · Mathematics 2025-02-10 Jiaqi Xie , Fei Xu

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Rings and Algebras · Mathematics 2018-09-19 Gyula Károlyi , Csaba Szabó