Related papers: An algorithm for constructing some maximal arcs in…
In this note, we prove several Tur\'an-type results on geometric hypergraphs. The two main theorems are 1) Every $n$-vertex geometric 3-hypergraph in 2-space with no three strongly crossing edges has at most $O(n^2)$ edges, 2) Every…
The rigorous theoretical analysis of the algorithm for a subclass of QSAT, i.e. (1, 2)-QSAT, has been proposed in the literature. (1, 2)-QSAT, first introduced in SAT'08, can be seen as quantified extended 2-CNF formulas. Until now, within…
We give an $n^{2+o(1)}$-time algorithm for finding $s$-$t$ min-cuts for all pairs of vertices $s$ and $t$ in a simple, undirected graph on $n$ vertices. We do so by constructing a Gomory-Hu tree (or cut equivalent tree) in the same running…
We compute the deformation space of quadratic letterplace ideals $L(2,P)$ of finite posets $P$ when its Hasse diagram is a rooted tree. These deformations are unobstructed. The deformed family has a polynomial ring as the base ring. The…
In this paper, we describe minimal presentations of maximal pro-$2$ quotients of absolute Galois groups of formally real Pythagorean fields of finite type. For this purpose, we introduce a new class of pro-$2$ groups: $\Delta$-Right Angled…
We study the problem of finding maximum-area triangles that can be inscribed in a polygon in the plane. We consider eight versions of the problem: we use either convex polygons or simple polygons as the container; we require the triangles…
We characterize planar diagrams which may be divided into n arc embeddings in terms of their chord diagrams, generalizing a result of Taniyama for the case n = 2. Two algorithms are provided, one which finds a minimal arc embedding (in…
A \textit{k}-arc in the projective space ${\rm PG}(n,q)$ is a set of $k$ projective points such that no subcollection of $n+1$ points is contained in a hyperplane. In this paper, we construct new $60$-arcs and $110$-arcs in ${\rm PG}(4,q)$…
The class of quasiseparable matrices is defined by a pair of bounds, called the quasiseparable orders, on the ranks of the maximal sub-matrices entirely located in their strictly lower and upper triangular parts. These arise naturally in…
We study problems connected to first-order logic in graphs of bounded twin-width. Inspired by the approach of Bonnet et al. [FOCS 2020], we introduce a robust methodology of local types and describe their behavior in contraction sequences…
We consider the question of orienting the edges in a graph $G$ such that every vertex has bounded out-degree. For graphs of arboricity $\alpha$, there is an orientation in which every vertex has out-degree at most $\alpha$ and, moreover,…
We establish an explicit bijection between the toric degenerations of the Grassmannian $\textrm{Gr}(2,n)$ arising from maximal cones in tropical Grassmannians and the ones coming from plabic graphs corresponding to $\textrm{Gr}(2,n)$. We…
A high-order quadrature algorithm is presented for computing integrals over curved surfaces and volumes whose geometry is implicitly defined by the level sets of (one or more) multivariate polynomials. The algorithm recasts the implicitly…
In 1998 the Adapted Ordering Method was developed for the study of the representation theory of the superconformal algebras in two dimensions. It allows: to determine the maximal dimension for a given type of space of singular vectors, to…
We present a method to obtain higher order integrals and polynomial algebras for two-dimensional superintegrable systems from creation and annihilation operators. All potentials with a second and a third order integrals of motion separable…
An arc is a set of vectors of the $k$-dimensional vector space over the finite field with $q$ elements ${\mathbb F}_q$, in which every subset of size $k$ is a basis of the space, i.e. every $k$-subset is a set of linearly independent…
Pseudorandom generators (PRGs) for low-degree polynomials are a central object in pseudorandomness, with applications to circuit lower bounds and derandomization. Viola's celebrated construction gives a PRG over the binary field, but with…
An approach for the computation of upper bounds on the size of large complete arcs is presented. We obtain in particular geometrical properties of irreducible envelopes associated to a second largest complete arc provided that the order of…
We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank $r$. Our main result is a deterministic algorithm to generate a matching which is an…
This paper deals with the problem of finding a collection of vertex-disjoint paths in a given graph G=(V,E) such that each path has at least four vertices and the total number of vertices in these paths is maximized. The problem is NP-hard…