Related papers: Piecewise-linear pseudodiagrams
A pseudo $(v,\, k,\, \la)$-design is a pair $(X, {\cal B})$ where $X$ is a $v$-set and ${\cal B}=\{B_1,...,B_{v-1}\}$ is a collection of $k$-subsets (blocks) of $X$ such that each two distinct $B_i, B_j$ intersect in $\la$ elements; and…
The present paper is concerned with the enumeration of the state diagrams for some classes of knot shadows endowed with the usual connected sum operation. We focus on shadows that are recursively generated by knot shadows with up to 3…
This article focuses on parabolic equations with rough diffusion coefficients which are ill-posed in the classical sense of distributions due to the presence of a singular forcing. Inspired by the philosophy of rough paths and regularity…
We prove the existence and uniqueness of strong solutions to the equation $u u_x - u_{yy} = f$ in the vicinity of the linear shear flow, subject to perturbations of the source term and lateral boundary conditions. Since the solutions we…
The problem of when a given digraph contains a subdivision of a fixed digraph $F$ is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algorithmic point of view. In this paper we give further support…
Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…
This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large…
Tropicalization is a procedure that takes subvarieties of an algebraic torus to balanced weighted rational complexes in space. In this paper, we study the tropicalizations of curves in surfaces in 3-space. These are balanced rational…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
Multivariate piecewise polynomial functions (or splines) on polyhedral complexes have been extensively studied over the past decades and find applications in diverse areas of applied mathematics including numerical analysis, approximation…
Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…
A {\it shadow} is an exact solution to a chaotic system of equations that remains close to a numerically computed solution for a long time, ending in a {\it glitch}. We study the distribution of shadow durations at low dimension and how…
Recently, a new way of avoiding crossings in straight-line drawings of non-planar graphs has been investigated. The idea of partial edge drawings (PED) is to drop the middle part of edges and rely on the remaining edge parts called stubs.…
This article settles the question of existence of smooth weak Fano threefolds of Picard number two with small anti-canonical map and previously classified numerical invariants obtained by blowing up certain curves on smooth Fano threefolds…
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning…
In this paper subdivision schemes, which are used for functions approximation and curves generation, are considered. In classical case, for the functions defined on the real line, the theory of subdivision schemes is widely known due to…
In this work we study some problems related with algebraic hypersurfaces invariant by foliations on weighted projective spaces $\mathbb{P}_{\mathbb{C}}(\varpi_0,...,\varpi_n)$ generalizing some results known for $\p$, as for example: the…
The positive zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring, and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and…
An open question in the theory of word-representable graphs for the past decade has been whether the line graph of a non-word-representable graph is always non-word-representable. By formulating an appropriate optimization problem for the…
For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none as forbidden. We examine structure of graphs whose degree sequences contain either…