Related papers: An algorithm for constructing some maximal arcs in…
We present a computationally efficient algorithm that can be used to generate all possible brane tilings. Brane tilings represent the largest class of superconformal theories with known AdS duals in 3+1 and also 2+1 dimensions and have…
A well-known result by Kant [Algorithmica, 1996] implies that n-vertex outerplane graphs admit embedding-preserving planar straight-line grid drawings where the internal faces are convex polygons in $O(n^2)$ area. In this paper, we present…
The existence of ovals and hyperovals is an old question in the theory of non-Desarguesian planes. The aim of this paper is to describe when a conic of ${\rm PG}(2,q)$ remains an arc in the Hall plane obtained by derivation. Some…
We describe an algorithm that we used to compute the q-expansions of all weight 2 cusp forms of prime level at most 2,000,000 and dimension at most 6. We also present an algorithm that we used to verify that there was only one cusp form of…
Motivated by previous computations in Garcia, Stichtenoth and Xing (2000) paper ,we discuss the spectrum $\mathbf{M}(q^2)$ for the genera of maximal curves over finite fields of order $q^2$ with $7\leq q\leq 16$. In particular, by using a…
An $(n,s,q)$-graph is an $n$-vertex multigraph in which every $s$-set of vertices spans at most $q$ edges. Tur\'an-type questions on the maximum of the sum of the edge multiplicities in such multigraphs have been studied since the 1990s.…
We consider the problem of constructing a bipartite graph whose degrees lie in prescribed intervals. Necessary and sufficient conditions for the existence of such graphs are well-known. However, existing realization algorithms suffer from…
A combinatorial characterization of resolvable Steiner 2-$(v,k,1)$ designs embeddable as maximal arcs in a projective plane of order $(v-k)/(k-1)$ is proved, and a generalization of a conjecture by Andries Brouwer \cite{Br} is formulated.
Explicit constructions of infinite families of scattered ${\mathbb F}_q$--linear sets in $PG(r-1,q^t)$ of maximal rank $\frac{rt}2$, for $t$ even, are provided. When $q=2$ and $r$ is odd, these linear sets correspond to complete caps in…
We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.
In this paper in $W_2^{(m,m-1)}(0,1)$ space the problem of construction of optimal quadrature formula in the sense of Sard is considered and using S.L. Sobolev's method it is obtained new optimal quadrature formula of such type. For the…
In the projective space $\mathrm{PG}(3,q)$, we consider the orbits of lines under the stabilizer group of the twisted cubic. In the literature, lines of $\mathrm{PG}(3,q)$ are partitioned into classes, each of which is a union of line…
Let $S$ be a set of $n$ points in the plane, $\wp(S)$ be the set of all simple polygons crossing $S$, $\gamma_P$ be the maximum angle of polygon $P \in \wp(S)$ and $\theta =min_{P\in\wp(S)} \gamma_P$. In this paper, we prove that…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
Let Q_0 be the classical generalized quadrangle of order q = 2n arising from a non-degenerate quadratic form in a 5-dimensional vector space defined over a finite field of order q. We consider the rank two geometry X having as points all…
Let $L$ be a set of $n$ lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement $A(L)$ of maximum level, where the level of a vertex $v$ is the number of…
We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space (V,q) with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of…
In this paper, we present a polynomial-time algorithm that approximates sufficiently high-value Max 2-CSPs on sufficiently dense graphs to within $O(N^{\varepsilon})$ approximation ratio for any constant $\varepsilon > 0$. Using this…
Let G = (V, E) be a planar triangulated graph (PTG) having every face triangular. A rectilinear dual or an orthogonal floor plan (OFP) of G is obtained by partitioning a rectangle into \mid V \mid rectilinear regions (modules) where two…
Under the assumption of a certain conjecture, for which there exists strong experimental evidence, we produce an efficient algorithm for constructive membership testing in the Suzuki groups Sz(q), where q = 2^{2m + 1} for some m > 0, in…