中文
相关论文

相关论文: Constructions of Generalized Sidon Sets

200 篇论文

We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…

逻辑 · 数学 2019-07-29 Jean S. Joseph

A natural generalization of single pattern avoidance is subset avoidance. A complete study of subset avoidance for the case k=3 is carried out in [SS]. For k>3 situation becomes more complicated, as the number of possible cases grows…

组合数学 · 数学 2007-05-23 T. Mansour

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…

组合数学 · 数学 2020-06-05 Beáta Bényi , Miguel Méndez , José L. Ramirez

In this note, we construct a 2-basic set of the alternating group \A_n. To do this, we construct a 2-basic set of the symmetric group \sym_n with an additional property, such that its restriction to \A_n is a 2-basic set. We adapt here a…

表示论 · 数学 2010-10-18 Olivier Brunat , Jean-Baptiste Gramain

It is shown how derived brackets naturally arise in sigma-models via Poisson- or antibracket, generalizing a recent observation by Alekseev and Strobl. On the way to a precise formulation of this relation, an explicit coordinate expression…

高能物理 - 理论 · 物理学 2010-10-27 Sebastian Guttenberg

A more sums than differences (MSTD) set is a finite subset S of the integers such that |S+S| > |S-S|. We construct a new dense family of MSTD subsets of {0, 1, 2, ..., n-1}. Our construction gives Theta(2^n/n) MSTD sets, improving the…

组合数学 · 数学 2015-10-26 Yufei Zhao

Given five positive integers $v, m,k,\lambda$ and $t$ where $v \geq k \geq t$ and $v \geq m \geq t,$ a $t$-$(v,k,m,\lambda)$ general covering design is a pair $(X,\mathcal{B})$ where $X$ is a set of $v$ elements (called points) and…

组合数学 · 数学 2012-12-21 Federico Montecalvo

We prove a generalisation of Roth's theorem for arithmetic progressions to d-configurations, which are sets of the form {n_i+n_j+a}_{1 \leq i \leq j \leq d} where a, n_1,..., n_d are nonnegative integers, using Roth's original density…

数论 · 数学 2012-11-15 Jehanne Dousse

We prove a structural result for sets of integers with doubling at most $4 + \delta$, with $\delta>0$ sufficiently small. This generalises earlier work of Eberhard--Green--Manners which dealt with sets of integers with doubling strictly…

数论 · 数学 2026-04-29 Yifan Jing , Akshat Mudgal

In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…

数论 · 数学 2025-10-02 Yagub N. Aliyev

It is shown how some of the recent results of de Souza et al. [1] can be generalized to describe Hamiltonians whose eigenvalues are given as k-generalized Fibonacci numbers. Here k is an arbitrary integer and the cases considered by de…

数学物理 · 物理学 2007-05-23 Matthias Schork

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…

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

In this study, we investigate the computational complexity of some variants of generalized puzzles. We are provided with two sets S_1 and S_2 of polyominoes. The first puzzle asks us to form the same shape using polyominoes in S_1 and S_2.…

计算复杂性 · 计算机科学 2023-05-19 Mutsunori Banbara , Shin-ichi Minato , Hirotaka Ono , Ryuhei Uehara

An $S_k$-set in a group $\Gamma$ is a set $A\subseteq\Gamma$ such that $\alpha_1\cdots\alpha_k=\beta_1\cdots\beta_k$ with $\alpha_i,\beta_i\in A$ implies $(\alpha_1,\ldots,\alpha_k)=(\beta_1,\ldots,\beta_k)$. An $S_k'$-set is a set such…

组合数学 · 数学 2025-09-10 John Byrne , Michael Tait

Compositional generalization refers to the ability to generalize to novel combinations of previously observed words and syntactic structures. Since it is regarded as a desired property of neural models, recent work has assessed…

计算与语言 · 计算机科学 2025-04-07 Ryoma Kumon , Daiki Matsuoka , Hitomi Yanaka

Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$…

组合数学 · 数学 2016-01-28 Luka Milićević

We calculate the structure of the finitely-generated groups H_2(SL_2(Z[1/m])) when m is a multiple of 6. We construct explicit homology classes which generate these groups and have prescribed orders. When n is at least 2 and m is the…

K理论与同调 · 数学 2015-02-13 Kevin Hutchinson

New generalized Poisson structures are introduced by using skew-symmetric contravariant tensors of even order. The corresponding `Jacobi identities' are given by the vanishing of the Schouten-Nijenhuis bracket. As an example, we provide the…

高能物理 - 理论 · 物理学 2008-02-03 J. A. de Azcarraga , A. M. Perelomov , J. C. Perez Bueno

This note is a contribution for a proceedings volume of the workshop "Higher Segal Spaces and their Applications to Algebraic K-Theory, Hall Algebras, and Combinatorics". The content is a streamlined exposition based on a talk about a…

代数拓扑 · 数学 2024-12-24 Martina Rovelli

We introduce the sequence of generalized Gon\v{c}arov polynomials, which is a basis for the solutions to the Gon\v{c}arov interpolation problem with respect to a delta operator. Explicitly, a generalized Gon\v{c}arov basis is a sequence…

组合数学 · 数学 2019-03-19 Rudolph Lorentz , Salvatore Tringali , Catherine H. Yan