Related papers: Extended Formulations for Independence Polytopes o…
For $\lambda$ inaccessible, we may consider $(< \lambda)$-support iteration of some specific $(<\lambda)$-complete $\lambda^+$-c.c. forcing notion. But this fails a "preservation by restricting to a sub-sequence of the forcing, we "correct"…
Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited…
Writing the boundary integral equation for an exterior problem of elasticity is subordinate so far to hypotheses on the asymptotical behaviour at infinity of solutions. The sufficient conditions met in the literature are too restrictive and…
It is shown that the condition of Theorem 1 in [1] never holds in practice and that Theorem 2 is incorrect under the stated condition. Extra assumptions or/and modifications are needed to make the conclusions of Theorem 1 and 2 above valid,…
Adding elements to matroids can be fraught with difficulty. In the V\'amos matroid $V_8$, there are four independent sets $X_1,X_2, X_3,$ and $X_4$ such that $(X_1 \cup X_2,X_3 \cup X_4)$ is a $3$-separation while exactly three of the local…
We study the pathology that causes tropical eigenspaces of distinct supertropical eigenvalues of a nonsingular matrix $A$, to be dependent. We show that in lower dimensions the eigenvectors of distinct eigenvalues are independent, as…
In this paper has been withrawn by the author due the error in the proof of theoem 1.
One of the two basic theorems in [5] on the existence of solutions of PDEs is improved with the use of a group analysis type argument.
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
This is a new version of our previous work. In this version, we fill a gap included in the original proof of Theorem 1.1 in our previous paper entitled "An iterative method for Kirchhoff type equations and its applications".
In this paper, we introduce the notion of augmentation for polytopes and use it to show the error in two presumptions that have been key in arriving at over-reaching/over-scoped claims of "impossibility" in recent extended formulations (EF)…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…
In the paper, some lower bounds for polygamma functions are refined.
We withdraw our paper as the factorizability of the correlation functions is unproven.
The note corrects the aforementioned paper (also, arXiv:0902.4716). The consequences of the correction are traced and the examples updated.
We correct a small gap found in the authors' paper 'On bounds for the effective differential Nullstellensatz' (J Algebra 449:1-21, 2016). This gap is due to an inequality that does not generally hold. However, under one additional…
The present paper is provided in response to the comment of M. R. Hadizadeh et.al on our original paper Six-body bound system calculations in the case of effective Alpha-core structure [Eur. Phys. J. Plus (2016) 131: 240].In this paper we…
We study the validity problem for propositional dependence logic, modal dependence logic and extended modal dependence logic. We show that the validity problem for propositional dependence logic is NEXPTIME-complete. In addition, we…
Complementing a study which was published in this journal in 2005, we present explicit calculations of fields predicted by Maxwell's equations both in Lorenz and in Coulomb gauge. Analytic expressions are obtainable, when the source of the…