English
Related papers

Related papers: Enumerations of (K_4-e)-designs with small orders

200 papers

Let $K$ be a prime knot in $S^3$ and $G(K)=\pi_1(S^3-K)$ the knot group. We write $K_1 \geq K_2$ if there exists a surjective homomorphism from $G(K_1)$ onto $G(K_2)$. In this paper, we determine this partial order on the set of prime knots…

Geometric Topology · Mathematics 2009-06-23 Keiichi Horie , Teruaki Kitano , Mineko Matsumoto , Masaaki Suzuki

Homotopic morphisms of $\mathbb E$-triangles in extriangulated categories are introduced. Any morphism of $\mathbb E$-triangles is a composition of homotopic morphisms. Any morphism $(\alpha_1, \alpha_2, \alpha_3)$ of $\mathbb E$-triangles…

Category Theory · Mathematics 2026-04-27 Chencheng Zhang , Xue-Song Lu , Pu Zhang

In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…

General Mathematics · Mathematics 2015-12-16 Dhananjay P. Mehendale

We prove that the lexicographic, degree lexicographic and the degree reverse lexicographic orders for monomials in $R_n=K[X_1,...X_n]$ are uniquely determined by their induced orderings, (i.e. their restrictions to $R_{n,i}=K[X_1,...,…

Commutative Algebra · Mathematics 2014-09-25 Gabriel Sosa

We propose a new method for the evaluation of intersection numbers for twisted meromorphic $n$-forms, through Stokes' theorem in $n$ dimensions. It is based on the solution of an $n$-th order partial differential equation and on the…

High Energy Physics - Theory · Physics 2023-07-12 Vsevolod Chestnov , Hjalte Frellesvig , Federico Gasparotto , Manoj K. Mandal , Pierpaolo Mastrolia

We investigate the automorphism group of the substructure ordering of finite directed graphs. The second author conjectured that it is isomorphic to the 768-element group $(\mathbb{Z}_2^4 \times S_4)\rtimes_{\alpha} \mathbb{Z}_2$. Though…

Combinatorics · Mathematics 2022-11-29 Fanni K. Nedényi , Ádám Kunos

Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $\pi_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|\pi_e(G)|+k$. We call such groups to be $co(k)$…

Group Theory · Mathematics 2007-05-23 Xianglin Du , Wujie Shi

We consider the self-assembly of cross junctions in a general space dimension ($d$) as an extension of the problem studied in a previous paper for $d = 3$. This problem is equivalent to constructing a $d$-dimensional hypercubic jungle gym,…

Statistical Mechanics · Physics 2026-05-26 Kazuya Saito

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.

Combinatorics · Mathematics 2020-12-09 Ryan Odeneal , Andrei Pavelescu

We study point-line incidence structures and their properties in the projective plane. Our motivation is the problem of the existence of $(n_4)$ configurations, still open for few remaining values of $n$. Our approach is based on…

Computational Geometry · Computer Science 2023-11-14 Jürgen Bokowski , Vincent Pilaud

Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…

Discrete Mathematics · Computer Science 2017-07-27 Nicolas Bonichon , Benjamin Lévêque

The largest prime p that can be the order of an automorphism of a 2-(35,17,8) design is p=17, and all 2-(35,17,8) designs with an automorphism of order 17 were classified by Tonchev. The symmetric 2-(35,17,8) designs with automorphisms of…

Combinatorics · Mathematics 2025-03-19 Sanja Rukavina , Vladimir D. Tonchev

We study optimization problems in which a linear functional is maximized over probability measures that are dominated by a given measure according to an integral stochastic order in an arbitrary dimension. We show that the following four…

Theoretical Economics · Economics 2026-03-13 Frank Yang , Kai Hao Yang

In this article, we introduce the $k$-th collineation variety of a third order tensor. This is the closure of the image of the rational map of size $k$ minors of a matrix of linear forms associated to the tensor. We classify such varieties…

Algebraic Geometry · Mathematics 2025-01-23 Fulvio Gesmundo , Hanieh Keneshlou

Sorting algorithms have attracted a great deal of attention and study, as they have numerous applications to Mathematics, Computer Science and related fields. In this thesis, we first deal with the mathematical analysis of the Quicksort…

Data Structures and Algorithms · Computer Science 2015-10-05 Vasileios Iliopoulos

Proving for triangulations an extended version of the 4-colour theorem by induction, we manage to exclude the case which led to the failure of Kempe's attempted proof. The new idea is to claim the existence of a "nice" 4-colouring, in which…

General Mathematics · Mathematics 2021-09-23 Peter Dörre

We show that any smooth, closed, oriented, connected 4--manifold can be trisected into three copies of $\natural^k (S^1 \times B^3)$, intersecting pairwise in 3--dimensional handlebodies, with triple intersection a closed 2--dimensional…

Geometric Topology · Mathematics 2017-01-04 David T. Gay , Robion Kirby

This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point…

Combinatorics · Mathematics 2015-11-17 Greg Aloupis , Brad Ballinger , Sébastien Collette , Stefan Langerman , Attila Pór , David R. Wood

We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs

Discrete Mathematics · Computer Science 2007-05-23 Ilya Safro