English
Related papers

Related papers: Additive systems and a theorem of de Bruijn

200 papers

It is well known that every positive integer can be expressed as a sum of nonconsecutive Fibonacci numbers provided the Fibonacci numbers satisfy $F_n =F_{n-1}+F_{n-2}$ for $n\geq 3$, $F_1 =1$ and $F_2 =2$. In this paper, for any…

Combinatorics · Mathematics 2019-02-06 Daniel Gotshall , Pamela E. Harris , Dawn Nelson , Maria D. Vega , Cameron Voigt

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

Combinatorics · Mathematics 2024-05-22 Kassie Archer , Alexander Diaz-Lopez , Darren Glass , Joel Louwsma

We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a graph is perfect if and only if certain nonnegative…

Optimization and Control · Mathematics 2023-05-03 Amir Ali Ahmadi , Cemil Dibek

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

Combinatorics · Mathematics 2025-09-17 Nataša Jonoska , Francisco Martinez-Figueroa , Masahico Saito

Transition Algebra (TA) is a type of infinite logic introduced to discuss rewriting systems. The natural deductive proof systems already introduced in TA satisfy completeness for countable signatures. However, it lacks compactness, making…

Logic in Computer Science · Computer Science 2026-05-06 Go Hashimoto

We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between the…

Number Theory · Mathematics 2011-09-02 Maksym Radziwill

A combinatorial principle CECA is formulated and its equivalence with GCH+ certain weakenings of Box_lambda for singular lambda is proved. CECA is used to show that certain ``almost point- < tau'' families can be refined to point- < tau…

The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…

Logic · Mathematics 2017-04-17 Joel David Hamkins , Makoto Kikuchi

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

Combinatorics · Mathematics 2026-04-29 Alexander Povolotsky

We study the structure of the codifferent and of additively indecomposable integers in families of totally real cubic fields. We prove that for cubic orders in these fields, the minimal trace of indecomposable integers multiplied by totally…

Number Theory · Mathematics 2022-12-16 Magdaléna Tinková

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

Number Theory · Mathematics 2019-09-04 Jagannath Bhanja , Ram Krishna Pandey

A positive integer n is said to be perfect if sigma(n)=2n, where sigma denotes the sum of the divisors of n. In this article, we show that if n is an even perfect number, then any integer m<=n is expressed as a sum of some of divisors of n.

History and Overview · Mathematics 2009-12-31 Yu Tsumura

We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…

Logic · Mathematics 2022-03-11 Ali Enayat

Let $A$ be a finite-dimensional simple algebra that is not a field. We show that every $a\in A$ can be written as $a=(bc-cb)(de-ed)$ for some $b,c,d,e\in A$. This is not always true for infinite-dimensional simple algebras. In fact, for any…

Rings and Algebras · Mathematics 2025-09-30 Matej Brešar , Hau-Yuan Jang , Leonel Robert

The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…

Number Theory · Mathematics 2011-09-05 Ala Avoyan , David Tsirekidze

In a multigranular framework, the two most important binary predicates are those for subsumption and disjointness. In the first part of this work, a sound and complete inference system for assertions using these predicates is developed. It…

Databases · Computer Science 2023-03-28 Stephen J. Hegner , M. Andrea Rodriguez

Systems of germs of sets in infinite-dimensional spaces are introduced and studied. Such a system corresponds to a local zero-set of an ideal of the ring of analytic functions of infinite number of variables. Conversely, this system of…

Complex Variables · Mathematics 2007-05-23 Dorota Mozyrska , Zbigniew Bartosiewicz

We give a construction that in many cases gives a simple way to construct infinite families of algebras that are not Morita equivalent, but are all derived equivalent to the same block algebra of a finite group, and apply it to some small…

Representation Theory · Mathematics 2013-10-10 Jeremy Rickard

An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…

Combinatorics · Mathematics 2015-04-03 Steffen Eger

To study the set of torsion classes of a finite dimensional basic algebra, we use a decomposition, called sign-decomposition, parametrized by elements of $\{\pm1\}^n$ where $n$ is the number of simple modules. If $A$ is an algebra with…

Representation Theory · Mathematics 2019-09-16 Toshitaka Aoki