相关论文: Maximal entries of elements in certain matrix mono…

We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size $n$…

Given a rooted tree $T$ with vertices $u_1,u_2,\ldots,u_n$, the level matrix $L(T)$ of $T$ is the $n \times n$ matrix for which the $(i,j)$-th entry is the absolute difference of the distances from the root to $v_i$ and $v_j$. This matrix…

In this work, we study the classical problem of maximizing a submodular function subject to a matroid constraint. We develop deterministic algorithms that are very parsimonious with respect to querying the submodular function, for both the…

We introduce two related notions of pattern enforcement in $(0,1)$-matrices: $Q$-forcing and strongly $Q$-forcing, which formalize distinct ways a fixed pattern $Q$ must appear within a larger matrix. A matrix is $Q$-forcing if every…

We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…

Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and $\mathbb{K}[x,y]$ the polynomial ring. The group $\text{SL}_{2}\left(\mathbb{K}[x,y]\right)$ of all matrices with determinant equal to $1$ over $\mathbb{K}[x,y]$…

We consider a notion of probabilistic rank and probabilistic sign-rank of a matrix, which measures the extent to which a matrix can be probabilistically represented by low-rank matrices. We demonstrate several connections with matrix…

A minimum depth d^I(S --> R) is assigned to a ring homomorphism S --> R and a R-R-bimodule I. The recent notion of depth of a subring d(S,R)in a paper by Boltje-Danz-Kuelshammer is recovered when I = R and S --> R is the inclusion mapping.…

Low-dimensional embeddings are essential for machine learning tasks involving graphs, such as node classification, link prediction, community detection, network visualization, and network compression. Although recent studies have identified…

Let $I$ be an ideal of a polynomial algebra $S$ over a field generated by square free monomials of degree $\geq d$. If $I$ contains more monomials of degree $d$ than $(n-d)/(n-d+1)$ of the total number of square free monomials of $S$ of…

The potential group method is applied to the n-dimensional Coulomb-Rosochatius potential, whose bound states and scattering states are worked out in detail. As far as scattering is concerned, the S-matrix elements are computed by the method…

Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary…

For $V$ a vector space over a field, or more generally, over a division ring, it is well-known that every $x\in\mathrm{End}(V)$ has an <i>inner inverse</i>, i.e., an element $y\in\mathrm{End}(V)$ satisfying $xyx=x.$ We show here that a…

A model of monopolium is constructed based on an electromagnetic dual formulation of Zwanziger and lattice gauge theory. To cope with the strong coupling nature of the magnetic charge, for which the monopole is confined, $ U(1) $ lattice…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero-one…

Let $\mathbb{F}$ be a field, and $n \geq p \geq r>0$ be integers. In a recent article, Rubei has determined, when $\mathbb{F}$ is the field of real numbers, the greatest possible dimension for an affine subspace of $n$--by--$p$ matrices…

We show that with high probability, random rank 1 matrices over a finite field are in (linearly) general position, at least provided their shape k x l is not excessively unbalanced. This translates into saying that the dimension of the…

Lattice-free sets (convex subsets of $\mathbb{R}^d$ without interior integer points) and their applications for cutting-plane methods in mixed-integer optimization have been studied in recent literature. Notably, the family of all integral…

Originally developed for imputing missing entries in low rank, or approximately low rank matrices, matrix completion has proven widely effective in many problems where there is no reason to assume low-dimensional linear structure in the…