Related papers: An optimal bound on the solution sets of one-varia…
Using the theory of fixed point index, we discuss the existence and multiplicity of non-negative solutions of a wide class of boundary value problems with coupled nonlinear boundary conditions. Our approach is fairly general and covers a…
Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant multiple of the weight in the second. We show that the…
We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…
We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraints, maximum number of occurrences of a variable in the…
This paper considers mathematical programs, whose constraints are expressed by a parameterized vector equilibrium problem. The latter is a well recognized framework, which is able to cover multicriteria optimization, vector variational…
We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a…
This work is devoted to establishing the local-in-time well-posedness of strong solutions to the three-dimensional compressible primitive equations of atmospheric dynamics. It is shown that strong solutions exist, unique, and depend…
In this paper, we study the existence and multiplicity of positive solutions for a nonlinear fourth-order with multi-point boundary conditions involving an integral boundary condition. The main tool is Krasnosel'skii fixed point theorem on…
We show that for any finite-rank free group $\Gamma$, any word-equation in one variable of length $n$ with constants in $\Gamma$ fails to be satisfied by some element of $\Gamma$ of word-length $O(\log (n))$. By a result of the first…
An initial-value problem for an ordinary differential equation of the first order, is considered. It is supposed that the right-hand side of the equation is a continuous function defined on a set consisting of an open set and a part of its…
We obtain a bound on the number of solutions of $x^q=x$ in a finite noncommutative algebra over a field with $q$ elements. Furthermore, we completely characterize those rings for which this maximum number is attained.
Improved upper and lower bounds on the number of square-free ternary words are obtained. The upper bound is based on the enumeration of square-free ternary words up to length 110. The lower bound is derived by constructing generalised…
We consider a Hamiltonian system of free boundary type, showing first uniform bounds and existence of solutions and of the free boundary. Then, for any smooth and bounded domain, we prove uniqueness of positive solutions in a suitable…
We study the stability and exact multiplicity of periodic solutions of the Duffing equation with cubic nonlinearities. We obtain sharp bounds for h such that the equation has exactly three ordered T-periodic solutions. Moreover, when h is…
In this paper we study the local behavior of a solution to the Stokes system with singular coefficients. One of the main results is the bound on the vanishing order of a nontrivial solution to the Stokes system, which is a quantitative…
We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with…
We prove that a class of superlinear indefinite problems with homogeneous Neumann boundary conditions admits an arbitrarily high number of positive solutions, provided that the parameters of the problem are adequately chosen. The…
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which…
We provide a formula for the lower bound in the form of $|F| \ge K$, in such a way that the decision version of unweighted non-bipartite matching can be solved in polynomial time. ~The parameter $K$ can vary from instance to instance. We…
We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…