English
Related papers

Related papers: Constructions of Generalized MSTD Sets in Higher D…

200 papers

The binary sum-of-digits function $s$ counts the number of ones in the binary expansion of a nonnegative integer. For any nonnegative integer $t$, T.~W.~Cusick defined the asymptotic density $c_t$ of integers $n\geq 0$ such that…

Number Theory · Mathematics 2022-05-02 Lukas Spiegelhofer , Michael Wallner

The asymptotic structure of gravity in $D=6$ spacetime dimensions is described at spatial infinity in the asymptotically flat context through Hamiltonian (ADM) methods. Special focus is given on the BMS supertranslation subgroup. It is…

High Energy Physics - Theory · Physics 2023-12-21 Oscar Fuentealba , Marc Henneaux

A generalized twistor transform for spinning particles in 3+1 dimensions is constructed that beautifully unifies many types of spinning systems by mapping them to the same twistor, thus predicting an infinite set of duality relations among…

High Energy Physics - Theory · Physics 2008-11-26 Itzhak Bars , Bora Orcal

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

Number Theory · Mathematics 2024-02-06 Mohan , Bhuwanesh Rao Patil , Ram Krishna Pandey

Let $\mathcal{S}$ be a commutative semigroup, and let $T$ be a sequence of terms from the semigroup $\mathcal{S}$. We call $T$ an (additively) {\sl irreducible} sequence provided that no sum of its some terms vanishes. Given any element $a$…

Combinatorics · Mathematics 2015-06-25 Guoqing Wang

We investigate additive codes, defined as $\mathbb{F}_q$-linear subspaces $C \subseteq \mathbb{F}_{q^h}^n$ of length $n$ and dimension $r$ over $\mathbb{F}_q$. An additive code is said to be of type $[n, r/h, d]_q^h$, where $d$ denotes the…

Combinatorics · Mathematics 2025-09-04 Daniele Bartoli , Alessandro Giannoni , Giuseppe Marino , Yue Zhou

A new mathematical structure, called the cross-dimensional mathematics (CDM), is proposed. The CDM considered in this paper consists of three parts: hyper algebra, hyper geometry, and hyper Lie group/Lie algebra. Hyper algebra proposes some…

Rings and Algebras · Mathematics 2026-01-16 Daizhan Cheng

For any integer $n \geq 2$, let $(m_{1},\ldots,m_{n})$ be a strictly increasing $n$-tuple of positive integers. We show that any subset $A\subset [N]^n$ of density at least $(\log N)^{-c}$ contains a nontrivial configuration of the form…

Number Theory · Mathematics 2026-05-08 Jingwei Guo , Changxing Miao , Guoqing Zhan

We provide exact and asymptotic formulae for the number of unrestricted, respectively indecomposable, $d$-dimensional matrices where the sum of all matrix entries with one coordinate fixed equals 2.

Combinatorics · Mathematics 2011-04-27 Peter J. Cameron , Christian Krattenthaler , Thomas W. Müller

A set of $k$ orthonormal bases of $\mathbb C^d$ is called mutually unbiased if $|\langle e,f\rangle |^2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. A natural question is for which pairs $(d,k)$ there exist~$k$ mutually…

Optimization and Control · Mathematics 2024-05-01 Sander Gribling , Sven Polak

Let $d,n$ be positive integers and $S$ be an arbitrary set of positive integers. We say that $d$ is an $S$-divisor of $n$ if $d|n$ and gcd $(d,n/d)\in S$. Consider the $S$-convolution of arithmetical functions given by (1.1), where the sum…

Number Theory · Mathematics 2007-05-23 László Tóth

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

Combinatorics · Mathematics 2017-12-06 Daniel Heinlein , Sascha Kurz

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

Data Structures and Algorithms · Computer Science 2024-10-29 Amir Abboud , Nick Fischer , Ron Safier , Nathan Wallheimer

The paper is devoted to developing subdifferential theory for set-valued mappings taking values in ordered infinite-dimensional spaces. This study is motivated by applications to problems of vector and set optimization with various…

Optimization and Control · Mathematics 2024-10-16 Boris S. Mordukhovich , Oanh Nguyen

We show that in a complex d-dimensional vector space, one can find O(d) bases whose elements form a 2-design. Such vector sets generalize the notion of a maximal collection of mutually unbiased bases (MUBs). MUBs have manifold applications…

Quantum Physics · Physics 2008-05-19 Gary McConnell , David Gross

Let $C$ be a $(n,q^{2k},n-k+1)_{q^2}$ additive MDS code which is linear over ${\mathbb F}_q$. We prove that if $n \geqslant q+k$ and $k+1$ of the projections of $C$ are linear over ${\mathbb F}_{q^2}$ then $C$ is linear over ${\mathbb…

Information Theory · Computer Science 2020-12-14 Simeon Ball , Guillermo Gamboa , Michel Lavrauw

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…

Combinatorics · Mathematics 2025-12-10 Csilla Bujtás , Sandi Klavžar , Jing Tian

Let A be a finite subset of a commutative additive group Z. The sumset and difference set of A are defined as the sets of pairwise sums and differences of elements of A, respectively. The well-known inequality $\sigma(A)^{1/2} \leq…

Combinatorics · Mathematics 2015-10-20 Merlijn Staps

MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently, the construction of MDS self-dual codes of new lengths has become an important and hot issue in coding theory. In this paper, we develop…

Information Theory · Computer Science 2022-10-04 Ruhao Wan , Yang Li , Shixin Zhu

In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…

Number Theory · Mathematics 2023-05-25 Ben Kane , Zichen Yang
‹ Prev 1 3 4 5 6 7 10 Next ›