English
Related papers

Related papers: Midpoint Diagonal Quadrilaterals

200 papers

Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…

Combinatorics · Mathematics 2021-11-19 Jiangdong Ai , Stefanie Gerke , Gregory Gutin , Yacong Zhou

Consider the smooth quadric Q_6 in P^7. The middle homology group H_6(Q_6,Z) is two-dimensional with a basis given by two classes of linear subspaces. We classify all threefolds of bidegree (1,p) inside Q_6.

Algebraic Geometry · Mathematics 2008-08-13 Lev Borisov , Jeff Viaclovsky

Let $s_{ij}$ represent a tranposition in $S_n$. A polynomial $P$ in $\mathbb{Q}[X_n]$ is said to be $m$-quasiinvariant with respect to $S_n$ if $(x_i-x_j)^{2m+1}$ divides $(1-s_{ij})P$ for all $1 \leq i, j \leq n$. We call the ring…

Combinatorics · Mathematics 2007-05-23 Jason Bandlow , Gregg Musiker

The length polyhedron $Q_P$ of an interval order $P$ is the convex hull of integral vectors representing the interval lengths in interval representations of $P$. This polyhedron has been studied by various authors, including Fishburn and…

Combinatorics · Mathematics 2024-10-30 Csaba Biró , André E. Kézdy , Jenő Lehel

Parallelogram polyominoes are a subclass of convex polyominoes in the square lattice that has been studied extensively in the literature. Recently congruence classes of convex polyominoes with respect to rotations and reflections have been…

Combinatorics · Mathematics 2007-05-23 Pierre Leroux , Etienne Rassart

Quadrilateral layouts on surfaces are valuable in texture mapping, and essential in generation of quadrilateral meshes and in fitting splines. Previous work has characterized such layouts as a special metric on a surface or as a meromorphic…

Computational Geometry · Computer Science 2020-12-18 Kendrick M. Shepherd , René R. Hiemstra , Thomas J. R. Hughes

A Circumconic passes through a triangle's vertices. We define the Circumbilliard, a circumellipse to a generic triangle for which the latter is a 3-periodic. We study its properties and associated loci.

Dynamical Systems · Mathematics 2020-04-16 Dan Reznik , Ronaldo Garcia

A link diagram can be considered as a $4$-valent graph embedded in the $2$-sphere and divides the sphere into complementary regions. In this paper, we show that any link has a diagram with only triangles and quadrilaterals. This extends…

Geometric Topology · Mathematics 2023-08-29 Reiko Shinjo , Kokoro Tanaka

We define a quasimodule Q over a bounded lattice L in an analogous way as a module over a semiring is defined. The essential difference is that L need not be distributive. Also for quasimodules there can be introduced the concepts of inner…

Rings and Algebras · Mathematics 2024-11-04 Ivan Chajda , Helmut Länger

We determine which of the modular curves $X_\Delta(N)$, that is, curves lying between $X_0(N)$ and $X_1(N)$, are bielliptic. Somewhat surprisingly, we find that one of these curves has exceptional automorphisms. Finally we find all…

Number Theory · Mathematics 2019-08-19 Daeyeol Jeon , Chang Heon Kim , Andreas Schweizer

Let us consider a family $F(\alpha,\beta,\gamma,\delta)$ of convex quadrangles in the plane with given angles $\{\alpha,\beta,\gamma,\delta\}$ and with the perimeter $2\pi$. Such quadrangle $Q\in F(\alpha,\beta,\gamma,\delta)$ can be…

Metric Geometry · Mathematics 2021-06-30 Yury Kochetkov

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

Group Theory · Mathematics 2021-05-07 R. A. Bailey , Peter J. Cameron , Cheryl E. Praeger , Csaba Schneider

A polyhedral surface~$\mathcal{C}$ in $\mathbb{R}^3$ with convex polygons as faces is a side-contact representation of a graph~$G$ if there is a bijection between the vertices of $G$ and the faces of~$\mathcal{C}$ such that the polygons of…

Computational Geometry · Computer Science 2023-08-02 André Schulz

We present a linear-time algorithm for finding the quadrilateral of largest area contained in a convex polygon, and we show that it is closely related to an old algorithm for the smallest enclosing parallelogram of a convex polygon.

Computational Geometry · Computer Science 2019-06-19 Günter Rote

A theorem of Meyer and Reisner characterizes ellipsoids by the collinearity of centroids of parallel sections: if $\Omega\subset\mathbb{R}^{n+1}$ is a convex body such that for every $n$-dimensional subspace $M\subset\mathbb{R}^{n+1}$ the…

Differential Geometry · Mathematics 2026-01-13 Alexandre Borentain

We study entanglement properties of hypergraph states in arbitrary finite dimension. We compute multipartite entanglement of elementary qudit hypergraph states, namely those endowed with a single maximum-cardinality hyperedge. We show that,…

Quantum Physics · Physics 2022-10-12 Daniele Malpetti , Alfredo Bellisario , Chiara Macchiavello

In this paper we consider planar polygons with parallel opposite sides. This type of polygons can be regarded as discretizations of closed convex planar curves by taking tangent lines at samples with pairwise parallel tangents. For this…

Differential Geometry · Mathematics 2013-07-09 Marcos Craizer , Ralph C. Teixeira , Moacyr A. H. B. da Silva

If there exists a cyclic quadrilateral whose sides go through the given four collinear points, then there are infinitely many such quadrilaterals inscribed in the same circle. We give two proofs of this porism; one based on cross-ratios,…

Metric Geometry · Mathematics 2014-12-11 Ivan Izmestiev

$q$-analogues of quantities in mathematics involve perturbations of classical quantities using the parameter $q$, and revert to the original quantities when $q$ goes $1$. An important example is the $q$-analogues of binomial coefficients…

Combinatorics · Mathematics 2021-05-18 Semin Yoo

Given a point set $P$ and a class $\mathcal{C}$ of geometric objects, $G_\mathcal{C}(P)$ is a geometric graph with vertex set $P$ such that any two vertices $p$ and $q$ are adjacent if and only if there is some $C \in \mathcal{C}$…

Computational Geometry · Computer Science 2012-11-13 Jasine Babu , Ahmad Biniaz , Anil Maheshwari , Michiel Smid