Related papers: There are no iterated morphisms that define the Ar…
This paper contains a complete study of superspecial curves of genus $4$ in characteristic $p\le 7$. We prove that there does not exist a superspecial curve of genus $4$ in characteristic $7$. This is a negative answer to the genus $4$ case…
We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…
Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…
We consider the set of affine permutations that avoid a fixed permutation pattern. Crites has given a simple characterization for when this set is infinite. We find the generating series for this set using the Coxeter length statistic and…
Let $\mathcal X_g$ be a genus $g\geq 2$ superelliptic curve, $F$ its field of moduli, and $K$ the minimal field of definition. In this short note we construct an equation of the curve $\mathcal X_g$ over its minimal field of definition $K$…
The 2-dimensional space-time sine-Gordon field theory is extended algebraically within the n-dimensional space of extended complex numbers. This field theory is constructed in terms of an adapted extension of standard vertex operators. A…
The contour argument was introduced by Peierls for two dimensional Ising model. Peierls benefited from the particular symmetries of the Ising model. For non-symmetric models the argument was developed by Pirogov and Sinai. It is very…
The subject of this paper is the problem of arrangement of a real nonsingular algebraic curve on a real non-singular algebraic surface. This paper contains new restrictions on this arrangement extending Rokhlin and Kharlamov-Gudkov-Krakhnov…
In this paper we prove that no consistent finitely axiomatized theory one-dimensionally interprets its own extension with predicative comprehension. This constitutes a result with the flavor of the Second Incompleteness Theorem whose…
A graph is {\it square-complementary} ({\it squco}, for short) if its square and complement are isomorphic. We prove that there is no squco graph of girth $6$, thus answersing a question asked by Milani\vc et al. [Discrete Math., 2014, to…
We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…
It has been shown by Nistor that given any extension of associative algebras over C, the connecting morphism in periodic cyclic homology is compatible, under the Chern-Connes character, with the index morphism in lower algebraic K-theory.…
Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph…
We prove a formula for the number of permutations in $S_n$ such that their first $n-k$ entries are increasing and their longest increasing subsequence has length $n-k$. This formula first appeared as a consequence of character polynomial…
Consider a sequence of LexBFS vertex orderings {\sigma}1, {\sigma}2, . . . where each ordering {\sigma}i is used to break ties for {\sigma}i+1. Since the total number of vertex orderings of a finite graph is finite, this sequence must end…
It is proved that the suspension of a closed n-dimensional manifold M, $n\ge1$, does not embed in a product of n+1 curves. In fact, the ultimate result will be proved in a much more general setting. This is a far-reaching generalization the…
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…