相关论文: A One-Line Proof of Leversha's "Quartet of Isogona…

In the paper I considered mappings of conjugation of quaternion algebra. I proved the theorem that there is unique expansion of R-linear mapping of quaternion algebra relative to the given set of mappings of conjugation.

We present a short exposition of the following results by S. Parsa. Let $L$ be a graph such that the join $L*\{1,2,3\}$ (i.e. the union of three cones over $L$ along their common bases) piecewise linearly (PL) embeds into $\mathbb R^4$.…

A low-dimensional version of our main result is the following `converse' of the Conway-Gordon-Sachs Theorem on intrinsic linking of the graph $K_6$ in 3-space: For any integer $z$ there are 6 points $1,2,3,4,5,6$ in 3-space, of which every…

In 1998 A. Connes proposed an algebraic proof of Morley's trisector theorem. He observed that the points of intersection of the trisectors are the fixed points of pairwise products of rotations around vertices of the triangle with angles…

Let $G$ be a tripartite graph with $N$ vertices in each vertex class. If each vertex is adjacent to at least $(2/3)N$ vertices in each of the other classes, then either $G$ contains a subgraph that consists of $N$ vertex-disjoint triangles…

In this paper, we present a minimal counterexample to a conjecture of Perles that answers a question of Haase and Ziegler. The example is a simple 4-polytope that has an induced 3-connected 3-regular subgraph, whose graph complement is…

We give a simple geometric interpretation of an algebraic construction of Wenger that yields $n$-vertex graphs with no cycle of length $4$, $6$ or $10$ and close to the maximum number of edges.

Let $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous. It follows from work of Chen, Ren, and…

We use Menger's Theorem and K\"onig's Line Colouring Theorem to show that in any tripartite graph with two complete (bipartite) sides the maximum number of pairwise edge-disjoint triangles equals the minimum number of edges that meet all…

Discrete analogs of extrema of curvature and generalizations of the four-vertex theorem to the case of polygons and polyhedra are suggested and developed. For smooth curves and polygonal lines in the plane, a formula relating the number of…

We revisit Eisenstein's geometric proof of quadratic reciprocity and make explicit the involutive symmetry underlying Eisenstein's lattice-point argument. Building on Gauss's lemma, we interpret the Legendre symbols as counts of lattice…

A known result in random matrix theory states the following: Given a random Wigner matrix $X$ which belongs to the Gaussian Orthogonal Ensemble (GOE), then such matrix $X$ has an invariant distribution under orthogonal conjugations. The…

We consider the class of Berge graphs that contain no odd prism and no square (cycle on four vertices). We prove that every graph G in this class either is a clique or has an even pair, as conjectured by Everett and Reed. This result is…

The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…

We go back to a graph used extensively in previous papers with Michela Procesi and Bich Van Nguyen to studi the non linear Scroginger equation. We fix several mistakes of that treatment and try to expand some proofs which were confused or…

Let $\F$ be an algebraically closed field. Let $\V$ be a vector space equipped with a non-degenerate symmetric or symplectic bilinear form $B$ over $\F$. Suppose the characteristic of $\F$ is \emph{large}, i.e. either zero or greater than…

We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…

In a witness rectangle graph (WRG) on vertex point set P with respect to witness points set W in the plane, two points x, y in P are adjacent whenever the open isothetic rectangle with x and y as opposite corners contains at least one point…

If $ABC$ is a given triangle in the plane, $P$ is any point not on the extended sides of $ABC$ or its anticomplementary triangle, $Q$ is the complement of the isotomic conjugate of $P$ with respect to $ABC$, $DEF$ is the cevian triangle of…

We consider the ring of invariants of n points on the projective line. The space (P^1)^n // PGL_2 is perhaps the first nontrivial example of a Geometry Invariant Theory quotient. The construction depends on the weighting of the n points.…