相关论文: Linear $(2,p,p)$-AONTs do Exist
Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orientation framework, which can be thought of as mapping an…
Let T denote the group of smooth concordance classes of topologically sice knots. We show that the first quotient in the bipolar filtration of T (i.e. 0-bipolar knots modulo 1-bipolar knots) has infinite rank, even modulo Alexander…
In this paper, we study all possible orders which are less than 1 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…
Self-orthogonal codes are an important subclass of linear codes which have nice applications in quantum codes and lattices. It is known that a binary linear code is self-orthogonal if its every codeword has weight divisible by four, and a…
If $p\in [1,+\infty]$ and $T$ is a linear operator with $p$-nuclear adjoint from a Banach space $ X$ to a Banach space $Y$ then if one of the spaces $X^*$ or $Y^{***}$ has the approximation property, then $T$ belongs to the ideal $N^p$ of…
We construct two complete invariants of oriented classical knots in space. The value of each invariant on any knot is a set, infinite for the first invariant and finite for the second. The finite set is computed algorithmically from any…
We study succinctness as a measure of the expressive power of transformers. Succinctness -- how compactly a formalism can describe a language relative to other formalisms -- is a classical notion in logic and automata theory. We prove that…
We define and study a transform whose iterates bring to the fore interesting relations between Pisot numbers and primes. Although the relations we describe are general, they take a particular form in the Pisot limit points. We give three…
The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for…
We present a recursive construction of a (2t + 1)-wise uniform set of permutations on 2n objects using a (2t + 1) - (2n, n, \cdot) combinatorial design, a t-wise uniform set of permutations on n objects and a (2t+1)-wise uniform set of…
Given a pointed metric space $M$, we study when there exist $n$-dimensional linear subspaces of $\operatorname{Lip}_0(M)$ consisting of strongly norm-attaining Lipschitz functionals, for $n\in\mathbb{N}$. We show that this is always the…
For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…
An orthogonal basis of weight vectors for a class of infinite-dimensional representations of the orthosymplectic Lie superalgebra osp(2m+1|2n) is introduced. These representations are particular lowest weight representations V(p), with a…
Amalgamation SNP (ASNP) is a fragment of existential second-order logic that strictly contains binary connected MMSNP of Feder and Vardi and binary guarded monotone SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate…
A balanced pair in a finite ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We prove that every finite $N$-free…
We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…
In this paper, we introduce a new class of subsets of bounded linear operators between Banach spaces which is p-version of the uniformly completely continuous sets. Then, we study the relationship between these sets with the equicompact…
A (v,k,t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering's size}, and the minimum size of…
An automaton is partially ordered if the only cycles in its transition diagram are self-loops. The expressivity of partially ordered NFAs (poNFAs) can be characterized by the Straubing-Th\'erien hierarchy. Level 3/2 is recognized by poNFAs,…
In this paper, for any odd prime $p$ and an integer $m\ge 3$, several classes of linear codes with $t$-weight $(t=3,5,7)$ are obtained based on some defining sets, and then their complete weight enumerators are determined explicitly by…