Related papers: Simple odd $\beta$-cycle inequalities for binary p…
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the…
A simple sufficient condition for certain cyclic algebras of odd degree d to be split is presented. It employs certain binary forms of degree d and the values they represent. A similar sufficient condition for certain Albert algebras not to…
We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…
We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…
In this article, a posteriori error analysis of the elliptic obstacle problem is addressed using hybrid high-order methods. The method involve cell unknowns represented by degree-$r$ polynomials and face unknowns represented by degree-$s$…
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random algorithm by keeping the accumulated rounding errors as small…
In this paper we extend three results about polycycles (also known as graphs) of planar smooth vector field to planar non-smooth vector fields (also known as piecewise vector fields, or Filippov systems). The polycycles considered here may…
The Delsarte linear program is used to bound the size of codes given their block length $n$ and minimal distance $d$ by taking a linear relaxation from codes to quasicodes. We study for which values of $(n,d)$ this linear program has a…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
According to a result of Arkin~\etal~(2016), given $n$ point pairs in the plane, there exists a simple polygonal cycle that separates the two points in each pair to different sides; moreover, a $O(\sqrt{n})$-factor approximation with…
Oriented graph discrepancy problems focus on finding specific subgraphs within a given oriented graph $G$ that contain a significant number of edges in one direction. This concept was first introduced by Gishboliner, Krivelevich, and…
Let $V$, $\tilde V$ be hypersurface germs in $\CC^m$, each having a quasi-homogeneous isolated singularity at the origin. We show that the biholomorphic equivalence problem for $V$, $\tilde V$ reduces to the linear equivalence problem for…
The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…
We study the problem of generating the endomorphism ring of a supersingular elliptic curve by two cycles in $\ell$-isogeny graphs. We prove a necessary and sufficient condition for the two endomorphisms corresponding to two cycles to be…
In order to study projections of smooth curves, we introduce multifiltrations obtained by combining flags of osculating spaces. We classify all configurations of singularities occurring for a projection of a smooth curve embedded by a…
Let $k,a,b$ be positive integers with $a+b=k$. A $k$-uniform hypergraph is called an $(a,b)$-cycle if there is a partition $(A_0,B_0,A_1,B_1,\ldots,A_{t-1},B_{t-1})$ of the vertex set with $|A_i|=a$, $|B_i|=b$ such that $A_i\cup B_i$ and…
We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqrt{n})$ for graphs on $n$ vertices. The constant-time…
For a class of polynomial non-autonomous differential equations of degree n, we use phase plane analysis to show that each equation in this class has n periodic solutions. The result implies that certain rigid two-dimensional systems have…
An (edge) decomposition of a graph $G$ is a set of subgraphs of $G$ whose edge sets partition the edge set of $G$. Here we show, for each odd $\ell \geq 5$, that any graph $G$ of sufficiently large order $n$ with minimum degree at least…
We consider the following problem: \begin{eqnarray*} ( P)\qquad \displaystyle\left\{\begin{array} {ll} & \Delta^2 u = K(x)u^{-\alpha} \quad \mbox{ in }\,\Omega , \\ &u> 0\quad \mbox{ in }\,\Omega, \;\;u\vert_{\partial\Omega}=0, \,\Delta…