Related papers: The Boolean SATisfiability Problem and the orthogo…

In Poisson Boolean models with deterministic ball grains, the directional visible range from an uncovered point is known to be exponentially distributed in Euclidean and real hyperbolic space. We show that the same phenomenon holds on every…

We elucidate, for the first time, a novel group-theoretic structure that arises from certain solutions of the $n$-dimensional Prouhet--Tarry--Escott problem of degree $2$ and size $n$. We prove that the group is isomorphic to the orthogonal…

The Milnor Problem (modified) in the theory of group growth asks whether any finite presented group of vanishing algebraic entropy has at most polynomial growth. We show that a positive answer to the Milnor Problem (modified) is equivalent…

This paper develops a parallel computational solver for computing all satifying assignments of a Boolean system of equations defined by Boolean functions of several variables. While there are we known solvers for satisfiability of Boolean…

The Lie group SO_0(n, 1) has the left-invariant metric coming from the Killing-Cartan form. The maximal compact subgroup SO(n) of the isometry group acts from the left. The geometry of the quotient space of the homogeneous submersion…

Using geometric mechanics methods, we examine aspects of the dynamics of n mass points in $\mathbb{R}^4$ with a general pairwise potential. We investigate the central force problem, set up the n-body problem and discuss certain properties…

An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…

For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable. In 2006, Gopalan…

We show that every algorithm for testing $n$-variate Boolean functions for monotonicity must have query complexity $\tilde{\Omega}(n^{1/4})$. All previous lower bounds for this problem were designed for non-adaptive algorithms and, as a…

We discuss the natural range of the Unambiguous-SAT problem with respect to the number of clauses. We prove that for a given Boolean formula in precise conjunctive normal form with n variables, there exist functions f(n) and g(n) such that…

Let $n\ge 2$ be an integer. To each irreducible representation $\sigma$ of $\mathrm O(1)$, an $\mathrm {O}(1)$-Kepler problem in dimension $n$ is constructed and analyzed. This system is super integrable and when $n=2$ it is equivalent to a…

We establish the relation between the ISO(2,1) homotopy invariants and the polygon representation of (2+1)-dimensional gravity. The polygon closure conditions, together with the SO(2,1) cycle conditions, are equivalent to the ISO(2,1) cycle…

We study the stability of fixed points in the two-loop renormalization group for the random field O($N$) spin model in $4+\epsilon$ dimensions. We solve the fixed-point equation in the 1/N expansion and $\epsilon$ expansion. In the large-N…

We apply Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) solvers in the context of finding chiral heterotic string models with positive cosmological constant from $\mathbb{Z}_2\times \mathbb{Z}_2$ orbifolds. The power…

We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…

We investigate the orderability properties of fundamental groups of 3-dimensional manifolds. Many 3-manifold groups support left-invariant orderings, including all compact P^2-irreducible manifolds with positive first Betti number. For…

We study the inverse problem in the theory of (standard) orthogonal polynomials involving two polynomials families $(P_n)_n$ and $(Q_n)_n$ which are connected by a linear algebraic structure such as $$P_n(x)+\sum_{i=1}^N…

We discuss an O(N) exension of the Sine-Gordon (S-G)equation which allows us to perform an expansion around the leading order in large-N result using Path-Integral methods. In leading order we show our methods agree with the results of a…

In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive integer functions, without actually providing their closed…

We consider finite energy equivariant solutions for the wave map problem from R2+1 to S2 which are close to the soliton family. We prove asymptotic orbital stability for a codimension two class of initial data which is small with respect to…