相关论文: Nonlinear Kernel Partition Regularity: Necessary a…
A proper vertex coloring of a connected graph $G$ is called an odd coloring if, for every vertex $v$ in $G$, there exists a color that appears odd number of times in the open neighborhood of $v$. The minimum number of colors required to…
An integer linear system is a set of inequalities with integer constraints. The solution graph of an integer linear system is an undirected graph defined on the set of feasible solutions to the integer linear system. In this graph, a pair…
A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…
Matrix regularity is a key to various problems in applied mathematics. The sufficient conditions, used for checking regularity of interval parametric matrices, usually fail in case of large parameter intervals. We present necessary and…
Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…
We study forced periodicity of two-dimensional configurations under certain constraints and use an algebraic approach to multidimensional symbolic dynamics in which $d$-dimensional configurations and finite patterns are presented as formal…
We study the row completion problem of polynomial and rational matrices with partial prescription of the structural data. The prescription of the complete structural data has been solved in Amparan et al., Lin. Alg. Appl. 720 (2025)…
Nonclassicality in the sense of quantum optics is a prerequisite for entanglement in multi-mode radiation states. In this work we bring out the possibilities of passing from the former to the latter, via action of classicality preserving…
If $f$ is a symmetric complex-valued function on the $m$-fold Cartesian product of the set of non-negative reals and $A$ is a positive semi-definite $m\times m$ matrix with eigenvalues $\lambda_j$, we set…
A real square matrix $A$ is called a $Q$-matrix if the linear complementarity problem $LCP(A,q)$ has a solution for all $q \in \mathbb{R}^n$. This means that for every vector $q$ there exists a vector $x$ such that $x \geq 0, y=Ax+q\geq 0$…
We consider certain large random matrices, called random inner-product kernel matrices, which are essentially given by a nonlinear function $f$ applied entrywise to a sample-covariance matrix, $f(X^TX)$, where $X \in \mathbb{R}^{d \times…
Green and Tao's arithmetic regularity lemma and counting lemma together apply to systems of linear forms which satisfy a particular algebraic criterion known as the `flag condition'. We give an arithmetic regularity lemma and counting lemma…
A system of linear equations $L$ over $\mathbb{F}_q$ is common if the number of monochromatic solutions to $L$ in any two-colouring of $\mathbb{F}_q^n$ is asymptotically at least the expected number of monochromatic solutions in a random…
Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…
A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with…
We address partition regularity problems for homogeneous quadratic equations. A consequence of our main results is that, under natural conditions on the coefficients $a,b,c$, for any finite coloring of the positive integers, there exists a…
Aperiodic tilings are non-periodic tilings characterized by local constraints. They play a key role in the proof of the undecidability of the domino problem (1964) and naturally model quasicrystals (discovered in 1982). A central question…
The vector partition function $p_A$ associated to a $d \times n$ matrix $A$ with integer entries is the function $\mathbb{Z}^d \to \mathbb{N}$ defined by $\mathbf{b} \to \#\{\mathbf{x} \in \mathbb{N}^n : A\mathbf{x} = \mathbf{b}\}$. It is…
Using the Perron-Frobenius eigenfunction and eigenvalue, each finite irreducible nonnegative matrix $A$ can be transformed into a probability kernel $P$. This was generalized by David Vere-Jones who gave necessary and sufficient conditions…
A vertex colouring of some graph is called perfect if each vertex of colour $i$ has exactly $a_{ij}$ neighbours of colour $j$. Being perfect imposes several restrictions on the colour incidence matrix $(a_{ij})$. We list several (old and…