相关论文: Additive systems and a theorem of de Bruijn

A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…

We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$. We prove that the following are equivalent over the weak…

We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…

This is an expository work presenting in detail the proof of the structure theorem for divisible abelian groups. A divisible abelian group is an abelian group that satisfies nD=D for all natural n. The theorem states that any divisible…

One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…

We prove a rank 1 version of the Hanna Neumann Theorem. This shows that every one-relator 2-complex without torsion has the nonpositive immersion property. The proof generalizes to staggered and reducible 2-complexes.

We demonstrate that topological defects in a rational conformal field theory can be described by a classifying algebra for defects - a finite-dimensional semisimple unital commutative associative algebra whose irreducible representations…

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

We prove that any finite set of real numbers can be split into two parts, one part being highly non-additive and the other highly non-multiplicative.

Zaremba's conjecture (1971) states that every positive integer number can be represented as a denominator (continuant) of a finit continued fraction with all partial quotients being bounded by an absolute constant A. Recently (in 2011)…

Let A be a set of nonnegative integers. For every nonnegative integer n and positive integer h, let r_{A}(n,h) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,..., a_h are elements of A and…

Let A be an alphabet and let F be a set of words with letters in A. We show that the sum of all words with letters in A with no consecutive subwords in F, as a formal power series in noncommuting variables, is the reciprocal of a series…

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

We study whether a unital associative algebra $ A $ over a field admits a decomposition of the form $A = Z(A) + [A,A]$ where $ Z(A) $ is the center of $ A $ and $ [A,A] $ denotes the additive subgroup of $A$ generated by all additive…

We generalize the validity criterion for the infinitary proof system of the multiplicative additive linear logic with fixed points. Our criterion is designed to take into account axioms and cuts. We show that it is sound and enjoys the cut…

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by…

Andrews, Brietzke, R\o dseth and Sellers proved an infinite family of congruences on the number of the restricted $m$-ary partitions when $m$ is a prime. In this note, we show that these congruences hold for arbitrary positive integer $m$…

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$. Lekkerkerker proved that the average number of summands for integers in $[F_n,…

Let~$A$ be a set of nonnegative integers. Let~$(h A)^{(t)}$ be the set of all integers in the sumset~$hA$ that have at least~$t$ representations as a sum of~$h$ elements of~$A$. In this paper, we prove that, if~$k \geq 2$,…