相关论文: Nonisomorphic Ordered Sets with Arbitrarily Many R…

Ahlswede and Cai proved that if a simple graph has nested solutions (NS) under the edge-isoperimetric problems, and the lexicographic (lex) order produces NS for its second cartesian power,then the lex order produces NS for any finite…

In this note, we establish an equivalence of categories between the category of all eight-dimensional composition algebras with any given quadratic form $n$ over a field $k$ of characteristic not two, and a category arising from an action…

Irreducible Artin groups of finite type can be parametrized via their associated Coxeter diagrams into six sporadic examples and four infinite families, each of which is further parametrized by the natural numbers. Within each of these four…

In this paper, we prove that the semigroups of invertible matrices with nonnegative elements over linearly oredered associative rings are elementarily equivalent if and only if the matrices have the same dimension and the rings are…

In this paper, we prove the existence of directed strongly regular graphs with parameters $(63,11,8,1,2)$. We construct a pair of nonisomorphic dsrg(63,11,8,1,2), where one is obtained from the other by reversing all arrows. Both directed…

Let $S$ be the collection of quadratic polynomial maps, and degree $2$-rational maps whose automorphism groups are isomorphic to $C_2$ defined over the rational field. Assuming standard conjectures of Poonen and Manes on the period length…

Using quasimodular forms with respect to $\Gamma_0(4)$ we find exact relations between the M2-rank for partitions without repeated odd parts and three residual cranks. From these identities we are able to deduce various congruences mod 3…

We define the Polish space $\mathcal{R}$ of non-degenerate rank-1 systems. Each non-degenerate rank-1 system can be viewed as a measure-preserving transformation of an atomless, $\sigma$-finite measure space and as a homeomorphism of a…

We show that for any $k$ at least $6$ and $g$ sufficiently large, the mapping class group of a surface of genus $g$ can be generated by three elements of order $k$. We also show that this can be done with four elements of order $5$. We…

We show that a web of codimension at least two and of maximal rank is isomorphic to an algebraic web. This solves a problem first consdered by Chern and Griffiths.

We construct non-isomorphic linear orders X and Y that are both left-hand and right-hand divisors of one another, answering positively a question of Sierpinski.

Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.…

For a given graph, the unlabeled subgraphs $G-v$ are called the cards of $G$ and the deck of $G$ is the multiset $\{G-v: v \in V(G)\}$. Wendy Myrvold [Ars Combinatoria, 1989] showed that a non-connected graph and a connected graph both on…

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…

In this paper, we provide algorithms to rank, unrank, and randomly generate certain degree-restricted classes of Cayley trees. Specifically, we consider classes of trees that have a given degree sequence or a given multiset of degrees. If…

Let $A$ and $A'$ be two Artin groups of spherical type, and let $A_1,\dots,A_p$ (resp. $A'_1,\dots,A'_q$) be the irreducible components of $A$ (resp. $A'$). We show that $A$ and $A'$ are commensurable if and only if $p=q$ and, up to…

We construct uncountably many mutually nonisomorphic simple separable stably finite unital exact C$^\ast$-algebras which are not isomorphic to their opposite algebras. In particular, we prove that there are uncountably many possibilities…

In this paper we illustrate by some examples the connection between the number of solutions of polynomial equations satisfying degree conditions and the number of rank I matrices related to persymmetric matrices.

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

Let k be an algebraically closed field of characteristic p different from 2, and let F be a nodal surface of degree d in the projective 3-space P over k (i.e. the singularities of F are only ordinary quadratic, nodes for short). Let N be a…