English
Related papers

Related papers: Overlaps in Field Generated Circular Planar Nearri…

200 papers

We introduce the class of circular-arc H-graphs, which generalizes circular-arc graphs, particularly circular-arc bigraphs. We investigate two types of ordering-based characterizations of circular-arc r-graphs. Finally, we provide forbidden…

Discrete Mathematics · Computer Science 2025-09-23 Indrajit Paul , Ashok Kumar Das

We study the Hadamard product of the linear forms defining a hyperplane arrangement with those of its dual, which we view as generating an ideal in a certain polynomial ring. We use this ideal, which we call the ideal of pairs, to study…

Combinatorics · Mathematics 2022-02-08 Avi Steiner , Graham Denham

We give a combinatorial characterization of isotropic subspaces in the Orlik- Solomon algebra of a hyperplane arrangement in terms of decorations of its intersection lattice. We then use this characterization to prove a result that relates…

Combinatorics · Mathematics 2010-07-19 Miguel A. Marco-Buzunariz

We study the connectedness and the diameter of orthogonality graphs of upper triangular matrix algebras over arbitrary fields.

Combinatorics · Mathematics 2016-02-11 Bakhad Bakhadly

Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…

Group Theory · Mathematics 2015-02-27 James East , Attila Egri-Nagy , Andrew R. Francis , James D. Mitchell

We study the 1-planar, quasi-planar, and fan-planar crossing number in comparison to the (unrestricted) crossing number of graphs. We prove that there are $n$-vertex 1-planar (quasi-planar, fan-planar) graphs such that any 1-planar…

Computational Geometry · Computer Science 2019-09-10 Markus Chimani , Philipp Kindermann , Fabrizio Montecchiani , Pavel Valtr

In this article we study fine regularity properties for mappings of finite distortion. Our main theorems yield strongly localized regularity results in the borderline case in the class of maps of exponentially integrable distortion.…

Complex Variables · Mathematics 2021-09-28 Olli Hirviniemi , István Prause , Eero Saksman

We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…

Representation Theory · Mathematics 2010-09-06 Raul A. Ferraz , Edgar G. Goodaire , Cesar Polcino Milies

We obtain several results concerning the concept of isotypic structures. Namely we prove that any field of finite transcendence degree over a prime subfield is defined by types; then we construct isotypic but not isomorphic structures with…

Logic · Mathematics 2025-06-18 Pavel Gvozdevsky

We study Dirichlet forms and Laplacians on self-similar sets with overlaps. A notion of "finitely ramified of finite type($f.r.f.t.$) nested structure" for self-similar sets is introduced. It allows us to reconstruct a class of self-similar…

Functional Analysis · Mathematics 2018-06-26 Shiping Cao , Hua Qiu

We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges…

Combinatorics · Mathematics 2021-03-16 András London , Ryan R. Martin , András Pluhár

We introduce a new class of generalised quadratic forms over totally real number fields, which is rich enough to capture the arithmetic of arbitrary systems of quadrics over the rational numbers. We explore this connection through a version…

Number Theory · Mathematics 2024-11-20 Tim Browning , Lillian B. Pierce , Damaris Schindler

Due to wide applications of binary sequences with low correlation to communications, various constructions of such sequences have been proposed in literature. However, most of the known constructions via finite fields make use of the…

Information Theory · Computer Science 2021-07-27 Lingfei Jin , Liming Ma , Chaoping Xing

In the making of origami, one starts with a piece of paper, and through a series of folds along seed points one constructs complicated three-dimensional shapes. Mathematically, one can think of the complex numbers as representing the piece…

Number Theory · Mathematics 2016-10-25 Juergen Kritschgau , Adriana Salerno

After giving an overview of the existing theory regarding the periods of sequences defined by linear recurrences over finite fields, we give explicit descriptions of the sets of periods that arise if one considers all sequences over…

Number Theory · Mathematics 2021-07-28 Michael R. Bush , Danjoseph Quijada

Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…

Data Structures and Algorithms · Computer Science 2019-08-27 Patrizio Angelini , Michael A. Bekos , Michael Kaufmann , Thomas Schneck

Let $k =\mathbb{F}_q$ be the finite field of $q$ elements and $E$ an elliptic curve over $k$. Let $F = k(E)$ be the function field over $E$ and let $\mathcal{O} = k[E]$ be the ring of integers. We fix the place at $\infty$ of $F$ and let…

Number Theory · Mathematics 2026-02-03 Seong Eun Jung

A planar hypermap with a boundary is defined as a planar map with a boundary, endowed with a proper bicoloring of the inner faces. The boundary is said alternating if the colors of the incident inner faces alternate along its contour. In…

Combinatorics · Mathematics 2021-07-21 Jérémie Bouttier , Ariane Carrance

In this paper we present a conjecture on the construction of generalised elliptic units above number fields with exactly one complex place. These elliptic units obtained as values of multiple elliptic Gamma functions. These form a…

Number Theory · Mathematics 2026-01-21 Pierre L. L. Morain

Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric functions. We extend some of the generating functions to cylindric partitions. Also, we show…

Combinatorics · Mathematics 2010-09-17 Sylvie Corteel , Cyrille Savelief , Mirjana Vuletić