中文
相关论文

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

200 篇论文

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Ba\v{s}i\'c, Fowler and Pisanski proved that the automorphism group of a nut graph has…

组合数学 · 数学 2025-08-26 Ksenija Rozman , Primož Šparl

We study large linear structures inside sets arising in the theory of norm-attaining operators. We provide several results in the context of lineability, spaceability, maximal-spaceability, and $(\alpha, \beta)$-spaceability for sets of…

泛函分析 · 数学 2026-03-23 Sheldon Dantas , Javier Falcó , Mingu Jung , Daniel L. Rodríguez-Vidanes

In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…

逻辑 · 数学 2018-12-04 Eddy El Khalil

For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…

逻辑 · 数学 2025-02-04 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

We show that there is an infinite set of primes $\mathcal{P}$ of density one, such that the family of \textit{all} Cayley graphs of $\mathrm{SL}(2,p)$%, $p\in \mathcal{P}$, is a family of expanders.

群论 · 数学 2009-11-17 Emmanuel Breuillard , Alex Gamburd

In this paper, we study the growth of transcendental entire solutions of linear difference equations \begin{equation} P_m(z)\Delta^mf(z)+\cdots+P_1(z)\Delta f(z)+P_0(z)f(z)=0,\tag{+} \end{equation} where $P_j(z)$ are polynomials for…

复变函数 · 数学 2025-04-04 Xiong-Feng Liu , Zhi-Tao Wen , Can-Xin Zhu

This paper provides an NP procedure that decides whether a linear-exponential system of constraints has an integer solution. Linear-exponential systems extend standard integer linear programs with exponential terms $2^x$ and remainder terms…

计算机科学中的逻辑 · 计算机科学 2024-07-10 Dmitry Chistikov , Alessio Mansutti , Mikhail R. Starchak

Given integers s and t, define a function phi_{s,t} on the space of all formal complex series expansions by phi_{s,t} (sum a_n x^n) = sum a_{sn+t} x^n. We define an integer r to be distinguished with respect to (s,t) if r and s are…

数论 · 数学 2007-05-23 Curtis D. Bennett , Edward Mosteig

We construct complete asymptotic expansions of solutions of the 1D semiclassical Schr\"odinger equation near transition points. There are three main novelties: (1) transition points of order $\kappa\geq 2$ (i.e.\ trapped points -- the…

经典分析与常微分方程 · 数学 2025-10-15 Ethan Sussman

We intend to investigate the metalogical property of 'omitting types' for a wide variety of quantifier logics (that can also be seen as multimodal logics upon identifying existential quantifiers with modalities syntactically and…

逻辑 · 数学 2019-12-30 Tarek Sayed Ahmed

This paper investigates the exponential Diophantine equation of the form $a^x+b=c^y$, where $a, b, c$ are given positive integers with $a,c \ge 2$, and $x,y$ are positive integer unknowns. We define this form as a "Type-I transcendental…

数论 · 数学 2025-10-15 Zeyu Cai

By using representation theory, we reduce the size of the set of possible values for the dimension of the convex hull of all feasible points polytope of an orthogonal array (OA) defining integer linear program (ILP). Our results address the…

表示论 · 数学 2023-01-06 Dursun Bulutoglu

We introduce a new framework called linear algebraic number theory (LANT) that reformulates the number-theoretic problem as a regression model and solves it using matrix algebra. This framework restricts all computations to log space,…

综合数学 · 数学 2017-09-19 Joram Soch

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…

数论 · 数学 2007-05-23 Ernie Croot

For each integer $m \geq 2$, a network is constructed which is solvable over an alphabet of size $m$ but is not solvable over any smaller alphabets. If $m$ is composite, then the network has no vector linear solution over any $R$-module…

信息论 · 计算机科学 2018-01-31 Joseph Connelly , Kenneth Zeger

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

Linear operators preserving the direct sum of polynomial rings P(m)\oplus P(n) are constructed. In the case |m-n|=1 they correspond to atypical representations of the superalgebra osp(2,2). For |m-n|=2 the generic, finite dimensional…

量子物理 · 物理学 2009-11-07 Yves Brihaye , Betti Hartmann

In this paper, we prove the existence of a bounded linear extension operator $T: L^{2,p}(E) \rightarrow L^{2,p}(\mathbb{R}^2)$ when $1<p<2$, where $E \subset \mathbb{R}^2$ is a certain discrete set with fractal structure. Our proof makes…

经典分析与常微分方程 · 数学 2023-12-14 Jacob Carruth , Arie Israel

A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…

数论 · 数学 2014-07-04 Jose Arnaldo B. Dris

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

数论 · 数学 2013-03-01 Terence Tao , Tamar Ziegler