English
Related papers

Related papers: Ovals and Hyperovals in Desarguesian Nets

200 papers

In recent work, the second and third authors introduced a technique for reachability checking in 1-bounded Petri nets, based on wiring decompositions, which are expressions in a fragment of the compositional algebra of nets with boundaries.…

Logic in Computer Science · Computer Science 2013-04-12 Julian Rathke , Pawel Sobocinski , Owen Stephens

We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…

Combinatorics · Mathematics 2019-08-15 Stefan Felsner

Recent work has shown that convolutional networks can be substantially deeper, more accurate, and efficient to train if they contain shorter connections between layers close to the input and those close to the output. In this paper, we…

Machine Learning · Computer Science 2020-01-09 Gao Huang , Zhuang Liu , Geoff Pleiss , Laurens van der Maaten , Kilian Q. Weinberger

In this paper, we find some necessary and sufficient conditions on the dimension vector $\underline{\bf{d}} = (d_1,..., d_k; n)$ so that the diagonal action of $\mathbb{P}GL(n)$ on $\prod_{i=1}^k Gr(d_i;n)$ has a dense orbit. Consequently,…

Algebraic Geometry · Mathematics 2015-02-03 Izzet Coskun , Majid Hadian , Dmitry Zakharov

We construct the Kuranishi spaces, or in other words, the versal deformations, for the following classes of connections with fixed divisor of poles $D$: all such connections, as well as for its subclasses of integrable, integrable…

Algebraic Geometry · Mathematics 2010-10-11 Francois-Xavier Machu

A line multigraph is obtained from a hypergraph as follows: the vertices of the multigraph correspond to the hyperedges of the hypergraph, and the number of edges between two vertices is given by the number of vertices shared by the…

Combinatorics · Mathematics 2026-01-15 Kauê Cardoso

Suppose $M$ is a hyperbolic 3-manifold which admits two Dehn fillings $M(r_1)$ and $M(r_2)$ such that $M(r_1)$ contains an essential torus and $M(r_2)$ contains an essential annulus. It is known that $\Delta = \Delta(r_1, r_2) \leq 5$. We…

Geometric Topology · Mathematics 2008-02-03 Cameron McA. Gordon , Ying-Qing Wu

The hedgehog $H_t$ is a 3-uniform hypergraph on vertices $1,\dots,t+\binom{t}{2}$ such that, for any pair $(i,j)$ with $1\le i<j\le t$, there exists a unique vertex $k>t$ such that $\{i,j,k\}$ is an edge. Conlon, Fox, and R\"odl proved that…

Combinatorics · Mathematics 2020-02-19 Jacob Fox , Ray Li

We prove that the set of points that have bounded orbits under certain diagonalizable flows is a hyperplane absolute winning subset of $SL_{n}(\mathbb{R})/SL_{n}(\mathbb{Z})$.

Dynamical Systems · Mathematics 2016-05-30 Lifan Guan , Weisheng Wu

We address the enumeration of planar 4-valent maps equipped with an Eulerian orientation by two different methods, and compare the solutions we thus obtain. With the first method we enumerate these orientations as well as a restricted class…

Combinatorics · Mathematics 2025-04-11 Mireille Bousquet-Mélou , Andrew Elvey Price , Paul Zinn-Justin

We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…

Classical Analysis and ODEs · Mathematics 2019-12-17 Yuan Xu

Consider the hypergraph whose vertex set is a family of $n$ lines in general position in the plane, and whose hyperedges are induced by intersections with a family of pseudo-discs. We prove that the number of $t$-hyperedges is bounded by…

Combinatorics · Mathematics 2022-08-29 Chaya Keller , Balázs Keszegh , Dömötör Pálvölgyi

The Descartes circle theorem states that if four circles are mutually tangent with disjoint intersion, then their curvatures (or "bends) b_j = 1/r_j satisfy the relation (b_1 + b_2 + b_3 + b_4)^2 = 2(b_1^2 + b_2^2 + b_3^2 + b_4^2). We show…

Metric Geometry · Mathematics 2007-05-23 Jeffrey C. Lagarias , Colin L. Mallows , Allan R. Wilks

We examine some six-dimensional orientifold models with $N = 1$ supersymmetry, which can be realised as intersecting 7-branes and 7-planes. These models are studied in the light of recent work showing that orientifold planes carry anomalous…

High Energy Physics - Theory · Physics 2009-10-30 Keshav Dasgupta , Sunil Mukhi

In 2007, Ando and Egawa proved a theorem which provides a lower bound on the number of contractible edges preserving $4$-connectedness in $4$-connected graphs. In this paper, we refine their bounds, especially for the $4$-connected plane…

Combinatorics · Mathematics 2026-04-06 Toshiki Abe , Michitaka Furuya , Raiji Mukae , Shoichi Tsuchiya

Solutions of an implicit ODE form a web. Already for cubic ODEs the 3-web of solutions has a nontrivial local invariant, namely the curvature form. Thus any local classification of implicit ODEs necessarily has functional moduli if no…

Differential Geometry · Mathematics 2008-08-05 S. I. Agafonov

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

Combinatorics · Mathematics 2020-04-24 Aaron Lin , Konrad Swanepoel

The classification of all semiovals and blocking semiovals in $\mathrm{PG}(2,8)$ and in $\mathrm{PG}(2,9)$ of size less than $17$ is determined. Also, some information on the stabilizer groups and the intersection sizes with lines is given.

Combinatorics · Mathematics 2013-12-10 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

A transversal coalition in a hypergraph $H$ is a partition of the vertex set $U$ into two subsets $U_1$ and $U_2$ such that neither $U_1$ nor $U_2$ alone intersects every hyperedge of $H$, but their union, $U_1 \cup U_2$, intersects every…

Combinatorics · Mathematics 2026-03-03 Vrushali Shinde , Lata Kadam

We study the existence of plane substructures in drawings of the $d$-dimensional hypercube graph $Q_d$. We construct drawings of $Q_d$ which contain no plane subgraph with more than $2d-2$ edges, no plane path with more than $2d-3$ edges,…

Computational Geometry · Computer Science 2026-03-06 Todor Antić , Niloufar Fuladi , Anna Margarethe Limbach , Pavel Valtr