Related papers: Expressing Linear Orders Requires Exponential-Size…
In this paper, it is shown that if F(x , y) is an irreducible binary form with integral coefficients and degree $n \geq 3$, then provided that the absolute value of the discriminant of F is large enough, the equation |F(x , y)| = 1 has at…
We introduce a new graph parameter called linear upper maximum induced matching width \textsc{lu-mim width}, denoted for a graph $G$ by $lu(G)$. We prove that the smallest size of the \textsc{obdd} for $\varphi$, the monotone 2-\textsc{cnf}…
This paper provides an NP procedure that decides whether a linear-exponential system of constraints has an integer solution. Linear-exponential systems extend standard integer linear programs with exponential terms $2^x$ and remainder terms…
A class of graphs admits an adjacency labeling scheme of size $b(n)$, if the vertices in each of its $n$-vertex graphs can be assigned binary strings (called labels) of length $b(n)$ so that the adjacency of two vertices can be determined…
In this paper, we consider bounded width circuits and nondeterministic circuits in three somewhat new directions. In the first part of this paper, we mainly consider bounded width circuits. The main purpose of this part is to prove that…
We prove a result on approximations to a real number $\theta$ by algebraic numbers of degree $\le 2$ in the case when we have information about the uniform Diophantine exponent $\hat{\omega}$ for the linear form $x_0 +\theta…
Any model of ZFC + GCH has a generic extension (made with a poset of size aleph_2) in which the following hold: MA + 2^{aleph_0}= aleph_2+ there exists a Delta^2_1-well ordering of the reals. The proof consists in iterating posets designed…
We prove that the number of vertices of a polytope of a particular kind is exponentially large in the dimension of the polytope. As a corollary, we prove that an n-dimensional centrally symmetric polytope with O(n) facets has 2^{Omega(n)}…
In this paper we have considered higher order two dimensional coupled system of non-linear ordinary differential equations. We have given necessary and sufficient conditions on the non-linear functions such that the solutions pair oscilla
We define and study certain linear orders on chainable continua. Those orders depend on a sequence of chains obtained from definition of chainability and on a fixed non-principal ultrafilter on the set of natural numbers. An alternative…
A $k$-cycle in a graph is a cycle of length $k.$ A graph $G$ of order $n$ is called edge-pancyclic if for every integer $k$ with $3\le k\le n,$ every edge of $G$ lies in a $k$-cycle. It seems difficult to determine the minimum size $f(n)$…
A deep neural network (DNN) with piecewise linear activations can partition the input space into numerous small linear regions, where different linear functions are fitted. It is believed that the number of these regions represents the…
Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to…
We give a density condition for when, subject to a necessary parity condition, an eulerian graph or digraph may be cellularly embedded in an orientable surface so that it has exactly two faces, each bounded by an euler circuit, one of which…
It is known for linear operators with polynomial coefficients annihilating a given D-finite function that there is a trade-off between order and degree. Raising the order may give room for lowering the degree. The relationship between order…
We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…
Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…
A graph $G=(V,E)$ is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite $1$-planar graphs with prescribed numbers of vertices in partite sets. Bipartite…
Partially ordered sets of type (k, n) are the sets such that a) cardinality of each set is n, b) dimension of each set is two, c) length of the maximal antichain in each set is k. Let \alpha_k(n) be the number of partially ordered sets of…
Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…