Related papers: Parameterized stratification and piece number of D…
Finite-dimensional square-free algebras have been completely characterized by Anderson and D'Ambrosia as certain twisted semigroup algebras over a square-free semigroup S with coefficients in a field K. D'Ambrosia extended the definition of…
Let $k$ be an algebraically closed field of characteristic zero, let $X$ and $Y$ be smooth irreducible algebraic curves over $k$, and let $D(X)$ and $D(Y)$ denote respectively the quotient division rings of the ring of differential…
Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph $G$, the segment number of $G$ is the minimum number of segments that can be achieved by any planar straight-line…
In [4] Bierstone and Parusinski proved the existence of global smoothings for closed subanalytic sets, both in an embedded and a non-embedded sense. In particular, in the non-embedded desingularization procedure the authors construct…
The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of…
We give a classification of semisimple and separable algebras in a multi-fusion category over an arbitrary field in analogy to Wedderben-Artin theorem in classical algebras. It turns out that, if the multi-fusion category admits a…
In this thesis, we consider semi-algebraic sets over a real closed field $R$ defined by quadratic polynomials. Semi-algebraic sets of $R^k$ are defined as the smallest family of sets in $R^k$ that contains the algebraic sets as well as the…
One of the central questions in Ramsey theory asks how small can be the size of the largest clique and independent set in a graph on $N$ vertices. By the celebrated result of Erd\H{o}s from 1947, the random graph on $N$ vertices with edge…
We prove a topological result concerning the kernel of a morphism d : E --> F of holomorphic vector bundles over a complex analytic space. As a consequence, we show that the projectivization P(ker d) is a quasifibration up to some…
We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p paths in the graph connecting the source with the sink and…
Let V, W be real algebraic varieties (that is, up to isomorphism, real algebraic sets), and let X be a subset of V. A map f from X into W is said to be regular if it can be extended to a regular map defined on some Zariski locally closed…
Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…
We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…
A digraph $D$ is called {\bf noneven} if it is possible to assign weights of 0,1 to its arcs so that $D$ contains no cycle of even weight. A noneven digraph $D$ corresponds to one or more nonsingular sign patterns. Given an $n \times n$…
A semialgebraic bijection from the field of p-adic numbers to itself minus one point is constructed. Semialgebraic p-adic sets are classified up to semialgebraic bijection. A cell decomposition theorem for restricted analytic p-adic maps is…
We determine the central simple algebras D over a functionfield K of trancendence degree two which admit a model of smooth Cayley-Hamilton algebras. This happens if and only if there is a smooth model S of K such that the ramification…
Our previous paper introduces topological notions of normal crossings symplectic divisor and variety and establishes that they are equivalent, in a suitable sense, to the desired geometric notions. Friedman's d-semistability condition is…
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the…
These notes constitute a survey on the geometric properties of globally subanalytic sets. We start with their definition and some fundamental results such as Gabrielov's Complement Theorem or existence of cell decompositions. We then give…
Given a graph $G = (V,E)$, $A \subseteq V$, and integers $k$ and $\ell$, the \textsc{$(A,\ell)$-Path Packing} problem asks to find $k$ vertex-disjoint paths of length $\ell$ that have endpoints in $A$ and internal points in $V \setminus A$.…