中文
相关论文

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

200 篇论文

Addition chains are a classical construction for fast exponentiation and related computation problems. In this paper, we study a chain for a fixed integer $n$ by decomposing each generator into a \emph{determiner} and a \emph{regulator}…

数论 · 数学 2026-04-23 Theophilus Agama

Every set $A$ of positive integers with upper Banach density 1 contains an infinite sequence of pairwise disjoint subsets $(B_i)_{i=1}^{\infty}$ such that $B_i$ has upper Banach density 1 for all $i \in \mathbf{N}$ and $\sum_{i\in I} B_i…

数论 · 数学 2020-04-17 Melvyn B. Nathanson

Let A be a finite subset of the integers or, more generally, of any abelian group, written additively. The set A has "more sums than differences" if |A+A|>|A-A|. A set with this property is called an MSTD set. This paper gives explicit…

数论 · 数学 2016-12-30 Melvyn B. Nathanson

Let $A$ be an additive basis. We call ``essential subset'' of $A$ any finite subset $P$ of $A$ such that $A \setminus P$ is not an additive basis and that $P$ is minimal (for the inclusion order) to have this property. A recent theorem due…

数论 · 数学 2008-07-23 Bakir Farhi

Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating a De Bruijn sequence of order n which are obtained by…

组合数学 · 数学 2017-05-23 Don Coppersmith , Robert C. Rhoades , Jeffrey M. VanderKam

Motivated by advances in categorical probability, we introduce non-commutative almost everywhere (a.e.) equivalence and disintegrations in the setting of C*-algebras. We show that C*-algebras (resp. W*-algebras) and a.e. equivalence classes…

量子物理 · 物理学 2023-12-18 Arthur J. Parzygnat , Benjamin P. Russo

Zeckendorf's theorem states that every positive integer can be uniquely decomposed into nonadjacent Fibonacci numbers. On the other hand, Chung and Graham proved that every positive integer can be uniquely written as a sum of even-indexed…

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…

组合数学 · 数学 2014-10-09 Vasek Chvatal

We consider a joint ordered multifactorisation for a given positive integer $n\geq 2$ into $m$ parts, where $n=n_1~\times~\ldots~\times~n_m$, and each part $n_j$ is split into one or more component factors. Our central result gives an…

A family of disjoint pairs of finite sets $\mathcal{P}=\{(A_i,B_i)\mid i\in[m]\}$ is called a Bollob\'as system if $A_i\cap B_j\neq\emptyset$ for every $i\neq j$, and a skew Bollob\'as system if $A_i\cap B_j\neq\emptyset$ for every $i<j$.…

组合数学 · 数学 2024-07-02 Erfei Yue

We consider the problem of describing all non-negative integer solutions to a linear congruence in many variables. This question may be reduced to solving the congruence $x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \equiv 0 \pmod n$ where values…

数论 · 数学 2012-05-16 John C. Harris , David L. wehlau

Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…

数论 · 数学 2022-05-10 Fang-Yu Ma

A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…

逻辑 · 数学 2017-02-23 Matthew Harrison-Trainor

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

组合数学 · 数学 2007-05-23 S. Corteel , C. D. Savage

Extension conjecture states that if a simple module over an artin algebra has nonzero first self-extension group then it has nonzero i-th self-extension group for infinitely many positive integers i. It is shown by recollement of…

表示论 · 数学 2014-07-08 Yang Han

A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…

逻辑 · 数学 2009-05-07 Karim Nour

We formulate and prove a de Finetti representation theorem for finitely exchangeable states of a quantum system consisting of k infinite-dimensional subsystems. The theorem is valid for states that can be written as the partial trace of a…

量子物理 · 物理学 2007-05-23 Christian D'Cruz , Tobias J. Osborne , Ruediger Schack

Let B be a sigma-unital C*-algebra. We show that every strongly continuous E_0-semigroup on the algebra of adjointable operators on a full Hilbert B-module E gives rise to a full continuous product system of correspondences over B. We show…

算子代数 · 数学 2013-11-20 Michael Skeide

We prove several basic extension theorems for reductive group schemes. We also prove that each Lie algebra with a perfect Killing form over a commutative $\dbZ$-algebra, is the Lie algebra of an adjoint group scheme.

数论 · 数学 2016-02-24 Adrian Vasiu

Eight categorical soundness and completeness theorems are established within the framework of algebraic theories. Exactly six of the eight deduction systems exhibit complete semantics within the cartesian monoidal category of sets. The…

范畴论 · 数学 2024-06-25 David Forsman