Related papers: A structure theorem for multiplicative functions o…

In this paper we introduce elements of algebraic geometry over an arbitrary algebraic structure. We prove Unification Theorems which gather the description of coordinate algebras by several ways.

Ramsey's theorem for $n$-tuples and $k$-colors ($\mathsf{RT}^n_k$) asserts that every k-coloring of $[\mathbb{N}]^n$ admits an infinite monochromatic subset. We study the proof-theoretic strength of Ramsey's theorem for pairs and two…

Function computation of arbitrarily correlated discrete sources over Gaussian networks with orthogonal components is studied. Two classes of functions are considered: the arithmetic sum function and the type function. The arithmetic sum…

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…

Baranyai's theorem is a well-known theorem in the theory of hypergraphs. A corollary of this theorem says that one can partition the family of all $u$-subsets of an $n$-element set into ${n-1\choose u-1}$ sub-families such that each…

We consider $d$-dimensional configurations, that is, colorings of the $d$-dimensional integer grid $\mathbb{Z}^d$ with finitely many colors. Moreover, we interpret the colors as integers so that configurations are functions $\mathbb{Z}^d…

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…

Given two combinatorial notions $\mathsf{P}_0$ and $\mathsf{P}_1$, can we encode $\mathsf{P}_0$ via $\mathsf{P}_1$. In this talk we address the question where $\mathsf{P}_0$ is 3-coloring of integers and $\mathsf{P}_1$ is product of…

We prove several congruences satisfied by the generalized cubic and generalized overcubic partition functions, recently introduced by Amdeberhan, Sellers, and Singh. We also prove infinite families of congruences modulo powers of $2$ and…

In this note, it is proved the existence of an infinitely generated multiplicative group consisting of entire functions that are, except for the constant function 1, hypercyclic with respect to the convolution operator associated to a given…

The \emph{coloring number} $\mathrm{col}(G)$ of a graph $G$, which is equal to the \emph{degeneracy} of $G$ plus one, provides a very useful measure for the uniform sparsity of $G$. The coloring number is generalized by three series of…

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…

Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…

This paper considers the problem of defining distributions over graphical structures. We propose an extension of the hyper Markov properties of Dawid and Lauritzen [Ann. Statist. 21 (1993) 1272-1317], which we term structural Markov…

A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…

We study the projection of an element of fractional Gaussian noise onto its neighbouring elements. We prove some analytic results for the coefficients of this projection, in particular, we obtain recurrence relations for them. We also make…

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

It is known that for an IP^{*} set A in (\mathbb{N},+) and a sequence \left\langle x_{n}\right\rangle _{n=1}^{\infty} in \mathbb{N}, there exists a sum subsystem \left\langle y_{n}\right\rangle _{n=1}^{\infty} of \left\langle…

In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…