中文
相关论文

相关论文: Linear $(2,p,p)$-AONTs do Exist

200 篇论文

We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Nathan Bowler , Sergey Goncharov , Paul Blain Levy , Lutz Schröder

Explicit constructions of infinite families of scattered ${\mathbb F}_q$--linear sets in $PG(r-1,q^t)$ of maximal rank $\frac{rt}2$, for $t$ even, are provided. When $q=2$ and $r$ is odd, these linear sets correspond to complete caps in…

组合数学 · 数学 2015-12-24 Daniele Bartoli , Massimo Giulietti , Giuseppe Marino , Olga Polverino

In this work, we prove the existence of linear recurrences of order M with a non-trivial solution vanishing exactly on the set of gaps (or a subset) of a numerical semigroup S finitely generated by a1 < a2 <...< aN and M = aN. Keywords:…

交换代数 · 数学 2013-11-01 Ivan Martino , Luca Martino

We give infinite triangularization and strict triangularization results for algebras of operators on infinite dimensional vector spaces. We introduce a class of algebras we call Ore-solvable algebras: these are similar to iterated Ore…

环与代数 · 数学 2020-07-27 Miodrag Iovanov , Jeremy Edison , Alexander Sistko

We consider an infinite family of exponents $e(l,k)$ with two parameters, $l$ and $k$, and derive sufficient conditions for $e(l,k)$ to be 0-APN over $\mathbb{F}_{2^n}$. These conditions allow us to generate, for each choice of $l$ and $k$,…

数论 · 数学 2023-04-10 Nikolay Kaleyski , Kjetil Nesheim , Patenlimon Stănică

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…

组合数学 · 数学 2016-09-12 Soumyabrata Pal , Shankar M. Venkatesan

In this article, we study the structure of the difference set $E - E$ for subsets $E \subseteq \mathbb{Z}^2$ of positive upper Banach density. Fish asked in [Proc. Amer. Math. Soc. 146 (2018), 3449-3453] whether, for every such set $E$,…

数论 · 数学 2026-01-21 Sayan Goswami

Let $m,n\ge 2$ be integers. Denote by $M_n$ the set of $n\times n$ complex matrices. Let $\|\cdot\|_{(p,k)}$ be the $(p,k)$ norm on $M_{mn}$ with $1\leq k\leq mn$ and $2<p<\infty$. We show that a linear map $\phi:M_{mn}\rightarrow M_{mn}$…

泛函分析 · 数学 2023-08-24 Zejun Huang , Nung-Sing Sze , Run Zheng

We introduce two classes of morphisms over the alphabet $A=\{0,1\}$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism…

组合数学 · 数学 2019-06-17 Petr Ambrož , Zuzana Masáková , Edita Pelantová

A graph $G=(V,E)$ is a \emph{word-representable graph} if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\in E$ for each $x\neq y$. In this paper we give an effective…

组合数学 · 数学 2015-01-29 Magnús M. Halldórsson , Sergey Kitaev , Artem Pyatkin

A set of $N$ permutations of $\{1,2,\ldots,v\}$ is $t$-suitable, if each symbol precedes each subset of $t-1$ others in at least one permutation. The extremal problem of determining the smallest size $N$ of such sets for given $v$ and $t$…

组合数学 · 数学 2018-08-10 Xiande Zhang

Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the *valid order arrangement*, whose regions correspond to the different orders in which a line through p can…

组合数学 · 数学 2013-06-11 Richard P. Stanley

Seymour's Second Neighborhood Conjecture (SNC) states that every oriented graph contains a vertex whose second neighborhood is as large as its first neighborhood. We investigate the SNC for orientations of both binomial and pseudo random…

组合数学 · 数学 2022-11-15 Fábio Botler , Phablo F. S. Moura , Tássio Naia

Given a set $S$ of $v \ge 2$ symbols, and integers $k \ge t \ge 2$ and $N \ge 1$, an $N \times k$ array $A \in S^{N \times k}$ is an $(N; t, k, v)$-covering array if all sequences in $S^t$ appear as rows in every $N \times t$ subarray of…

组合数学 · 数学 2017-03-29 Shagnik Das , Tamás Mészáros

If $A$ is an integer valued, strictly expansive matrix, then there exists an orthonormal $A$-wavelet whose Fourier transform is compactly supported and smooth. We show that strongly connected diagonally dominant integer matrices are…

经典分析与常微分方程 · 数学 2025-06-10 Darrin Speegle

The main purpose of this paper is to find all the prime numbers p for which whenever we add to p an odd square less than p we obtain a number which has at most two different prime factors. We solve completely the cases $p\equiv 1,3,5 \pmod…

数论 · 数学 2024-01-30 Alexandru Gica

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

综合数学 · 数学 2007-05-23 W. Mueckenheim

We prove an infinite Ramsey theorem for noncommutative graphs realized as unital self-adjoint subspaces of linear operators acting on an infinite dimensional Hilbert space. Specifically, we prove that if V is such a subspace, then provided…

算子代数 · 数学 2017-11-28 Matthew Kennedy , Taras Kolomatski , Daniel Spivak

We consider the structure $(\mathbb{Z},+,0,|_{p_{1}},\dots,|_{p_{n}})$, where $x|_{p}y$ means $v_{p}(x)\leq v_{p}(y)$ and $v_p$ is the $p$-adic valuation. We prove that its theory has quantifier elimination in the language…

逻辑 · 数学 2019-06-12 Eran Alouf , Christian d'Elbée

For a prime p and natural number n with p greater than or equal to n, we establish the existence of a non-functorial one-to-one correspondence between isomorphism classes of groups of order p^n whose derived subgroup has exponent dividing…

群论 · 数学 2007-05-23 Paul J. Sanders