Related papers: Linear Congruences in several variables with congr…
This paper proposes a new approach to analyze and synthesize robust consensus control laws for general linear leaderless multi-agent systems (MASs) subjected to input constraints or uncertainties. First, the MAS under input constraints or…
We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…
As a continuation of our previous work \cite{KV2} the aim of the recent paper is to investigate the solutions of special inhomogeneous linear functional equations by using spectral synthesis in translation invariant closed linear subspaces…
Our general aim is to give sufficient conditions for robustness behavior and convergence to the equilibrium point of linear time-varying fractional system's solutions. We approach this problem using as a framework a series of recent results…
An explicit formula for a weight enumerator of linear-congruence codes is provided. This extends the work of Bibak and Milenkovic [IEEE ISIT (2018) 431-435] addressing the binary case to the non-binary case. Furthermore, the extension…
Motivated by two identities published with Ramanujan's lost notebook and connected, respectively, with the Gauss circle problem and the Dirichlet divisor problem, in an earlier paper, three of the present authors derived representations for…
In this paper, we provide a combinatorial criteria for equigenerated monomial ideals in three variables to have linear resolutions. As a consequence, we prove that in three variables, equigenerated monomial ideals with linear resolutions…
This dissertation studies the Fourier restriction, which is to find the range of the constants p, q such that the L^q norm on a chosen subset of the Fourier domain is bounded above by the L^p norm in a spacial domain, up to some constant…
In this note we solve, except for extremely pathological cases, a question posed by Puglisi and Seoane-Sepulveda on the lineability of the set of bounded non-absolutely summing linear operators. We also show how the idea of the proof can be…
Motivated by satisfiability of constraints with function symbols, we consider numerical inequalities on non-negative integers. The constraints we consider are a conjunction of a linear system Ax = b and a conjunction of (non-)convex…
This paper considers the length of resolution proofs when using Krishnamurthy's classic symmetry rules. We show that inconsistent linear equation systems of bounded width over a fixed finite field $\mathbb{F}_p$ with $p$ a prime have, in…
We obtain the symmetry algebra of multi-matrix models in the planar large N limit. We use this algebra to associate these matrix models with quantum spin chains. In particular, certain multi-matrix models are exactly solved by using known…
Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there are definite programs and constraint logic programs that compute a solution as an answer substitution to a query…
The sum formula for finite and symmetric multiple zeta values, established by Wakabayashi and the authors, implies that if the weight and depth are fixed and the specified component is required to be more than one, then the values sum up to…
We derive a path counting formula for two-dimensional lattice path model with filter restrictions in the presence of long steps, source and target points of which are situated near the filters. This solves a problem of finding an explicit…
In this paper, we construct an estimator of an errors-in-variables linear regression model. The regression model leads to a constrained total least squares problems with row and column constraints. Although this problem can be numerically…
The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set. We study a cardinality constrained…
In this paper, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a bounded number of calculations. Using periodicity for partition functions, our…
In this short note, we extend the linear convergence result of the Cauchy algorithm, derived recently by E. Klerk, F. Glineur, and A. Taylor, from the case of smooth strongly convex functions to the case of restricted strongly convex…
In the first two papers, the author embarked on a study of classes of linear equations over integers satisfying a "Farkas-type" property. As the third paper in this study, the present paper deals with another class of linear equations over…