Related papers: Overlaps in Field Generated Circular Planar Nearri…
As a topic of mathematics, "arrangements", systems of hyperplanes, circles, and general (regular) submanifolds, attract us strongly. We present a natural elementary study of arrangements of circles. It is also a kind of new studies. Our…
In this survey article, we summarise the known results towards the conjecture: elliptic curves over totally real number fields are modular. For understanding these recent results in the literature, we present some necessary background along…
For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…
We study the orbit of $\mathbb{R}$ under the Bianchi group $\operatorname{PSL}_2(\mathcal{O}_K)$, where $K$ is an imaginary quadratic field. The orbit, called a Schmidt arrangement $\mathcal{S}_K$, is a geometric realisation, as an…
We survey some aspects of the perfect matching problem in hypergraphs, with particular emphasis on structural characterisation of the existence problem in dense hypergraphs and the existence of designs.
We compute the equations of all rational double point singularities and we determine their types over perfect ground fields $k$ that arise as quotient singularities by finite linearly reductive subgroup schemes of $\textrm{SL}_{2,k}$.
We describe the "generic" part of the character ring of general linear groups over a finite field in terms of quiver representations.
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
Vector spaces over finite fields and Anzahl formulas of subspaces were studied by Wan (Geometry of Classical Groups over Finite Fields, Science Press, 2002). As a generalization, we study vector spaces and singular linear spaces over…
We classify flips of buildings arising from non-degenerate unitary spaces of dimension at least 4 over finite fields of odd characteristic in terms of their action on the underlying vector space. We also construct certain geometries related…
The crossing number of a graph is the least number of crossings over all drawings of the graph in the plane. Computing the crossing number of a given graph is NP-hard, but fixed-parameter tractable (FPT) with respect to the natural…
We present an explicit formula for subregular characters (i.e, irreducible finite-dimensional complex characters of submaximal degree) of the unitriangular group over a finite field of sufficiently large characteristic.
We find and describe unexpected isomorphisms between two very different objects associated to hypersurface singularities. One object is the Milnor algebra of a function, while the other object associated to a singularity is the local ring…
Cataloging planar diagrams using the depth concept is proposed.
The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length $n$ and edges that are permutations of length $n+1$ in which an edge $a_1\cdots…
We give a construction of unramified cyclic octic extensions of certain complex quadratic number fields. The binary quadratic form used in this construction also shows up in the theory of 2-descents on Pell conics and elliptic curves, as…
Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterion for the quality of a drawing is the number of edge…
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs. In…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…