This paper is about $0/1$-triangles, which are the simplest nontrivial examples of $0/1$-polytopes: convex hulls of a subset of vertices of the unit $n$-cube $I^n$. We consider the subclasses of right $0/1$-triangles, and acute $0/1$-triangles, which only have acute angles. They can be explicitly counted and enumerated, also modulo the symmetries of $I^n$.

Let g be a Gaussian random vector in ℝⁿ. Let N = N(n) be a positive integer and let $K_N$ be the convex hull of N independent copies of g. Fix R > 0 and consider the ratio of volumes $V_N:=vol\left(K_N\cap RB₂ⁿ\right)/vol\left(RB₂ⁿ\right)$. For a large range of R = R(n), we establish a sharp threshold for N, above which $V_N\to 1$ as n → ∞, and below which $V_N\to 0$ as n → ∞. We also consider the case when $K_N$ is generated by independent random vectors distributed uniformly on the Euclidean sphere. In this case, similar threshold results are proved for both...

A $0/1$-simplex is the convex hull of $n+1$ affinely independent vertices of the unit $n$-cube $I^n$. It is nonobtuse if none of its dihedral angles is obtuse, and acute if additionally none of them is right. Acute $0/1$-simplices in $I^n$ can be represented by $0/1$-matrices $P$ of size $n\times n$ whose Gramians $G=P^{\top }P$ have an inverse that is strictly diagonally dominant, with negative off-diagonal entries. In this paper, we will prove that the positive part $D$ of the transposed inverse $P^{-\top }$ of $P$ is doubly stochastic and has the...

In this paper, we propose the general methods, yielding uninorms on the bounded lattice $(L,\le ,0,1)$, with some additional constraints on $e\in L\setminus \{0,1\}$ for a fixed neutral element $e\in L\setminus \{0,1\}$ based on underlying an arbitrary triangular norm $T_e$ on $[0,e]$ and an arbitrary triangular conorm $S_e$ on $[e,1]$. And, some illustrative examples are added for clarity.

Let ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to d}$ be the following algorithmic problem: Given a finite simplicial complex $K$ of dimension at most $k$, does there exist a (piecewise linear) embedding of $K$ into ${ℝ}^d$? Known results easily imply polynomiality of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to 2}$ ($k=1,2$; the case $k=1,d=2$ is graph planarity) and of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to 2k}$ for all $k\ge 3$. We show that the celebrated result of Novikov on the algorithmic unsolvability of recognizing the 5-sphere implies that ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{d\to d}$ and ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{(d-1)\to d}$ are undecidable for each ${}_d\ge 5$. Our main result is NP-hardness of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{2\to 4}$ and, more generally, of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to d}$ for all...

Let $f^j={\sum }_k{a}_{k}f(2^{j+1}x-2k)$, where the sum is taken over the lattice of all points k in ${ℝ}^n$ having integer-valued components, j∈ℕ and $a_k\in ℂ$. Let $A_{pq}^s$ be either $B_{pq}^s$ or $F_{pq}^s$ (s ∈ ℝ, 0 < p < ∞, 0 < q ≤ ∞) on ${ℝ}^n.$ The aim of the paper is to clarify under what conditions $\parallel f^j|A_{pq}^s\parallel$ is equivalent to $2^{j(s-n/p)}({\sum }_k|a_k{|}^p{)}^{1/p}\parallel f|A_{pq}^s\parallel$.

Let $\Delta$ be a pure simplicial complex on the vertex set $\left[n\right]=\{1,...,n\}$ and $I_{\Delta }$ its Stanley-Reisner ideal in the polynomial ring $S=K[x_1,...,x_n]$. We show that $\Delta$ is a matroid (complete intersection) if and only if $S/I_{\Delta }^{\left(m\right)}$ ($S/I_{\Delta }^m$) is clean for all $m\in \mathbb{N}$ and this is equivalent to saying that $S/I_{\Delta }^{\left(m\right)}$ ($S/I_{\Delta }^m$, respectively) is Cohen-Macaulay for all $m\in \mathbb{N}$. By this result, we show that there exists a monomial ideal $I$ with (pretty) cleanness property while $S/I^m$ or $S/I^{\left(m\right)}$ is not (pretty) clean for all integer $m\ge 3$. If $dim\left(\Delta \right)=1$, we also prove that $S/I_{\Delta }^{\left(2\right)}$ ($S/I_{\Delta }^2$) is clean if and only...

Acute triangles are defined by having all angles less than $\pi /2$, and are characterized as the triangles containing their circumcenter in the interior. For simplices of dimension $n\ge 3$, acuteness is defined by demanding that all dihedral angles between $(n-1)$-dimensional faces are smaller than $\pi /2$. However, there are, in a practical sense, too few acute simplices in general. This is unfortunate, since the acuteness property provides good qualitative features for finite element methods. The property...

We lift the notion of quasicontinuous posets to the topology context, called quasicontinuous spaces, and further study such spaces. The main results are: (1) A $T_0$ space $(X,\tau )$ is a quasicontinuous space if and only if $SI\left(X\right)$ is locally hypercompact if and only if $({\tau }_{SI},\subseteq )$ is a hypercontinuous lattice; (2) a $T_0$ space $X$ is an $SI$-continuous space if and only if $X$ is a meet continuous and quasicontinuous space; (3) if a $C$-space $X$ is a well-filtered poset under its specialization order, then $X$ is a quasicontinuous...

Suppose that $A$ is a real symmetric matrix of order $n$. Denote by $m_A\left(0\right)$ the nullity of $A$. For a nonempty subset $\alpha$ of $\{1,2,...,n\}$, let $A\left(\alpha \right)$ be the principal submatrix of $A$ obtained from $A$ by deleting the rows and columns indexed by $\alpha$. When $m_{A\left(\alpha \right)}\left(0\right)=m_A\left(0\right)+\left|\alpha \right|$, we call $\alpha$ a P-set of $A$. It is known that every P-set of $A$ contains at most $\lfloor n/2\rfloor$ elements. The graphs of even order for which one can find a matrix attaining this bound are now completely characterized. However, the odd case turned out to be more difficult to tackle. As...

The general method of averaging for the superapproximation of an arbitrary partial derivative of a smooth function in a vertex $a$ of a simplicial triangulation $𝒯$ of a bounded polytopic domain in ${\Re }^d$ for any $d\ge 2$ is described and its complexity is analysed.

For a finite Coxeter group $W$ and a Coxeter element $c$ of $W$; the $c$-Cambrian fan is a coarsening of the fan defined by the reflecting hyperplanes of $W$. Its maximal cones are naturally indexed by the $c$-sortable elements of $W$. The main result of this paper is that the known bijection cl${}_c$ between $c$-sortable elements and $c$-clusters induces a combinatorial isomorphism of fans. In particular, the $c$-Cambrian fan is combinatorially isomorphic to the normal fan of the generalized associahedron for...

Let ${𝕄}_{n,m}$ be the set of all $n\times m$ real or complex matrices. For $A,B\in {𝕄}_{n,m}$, we say that $A$ is row-sum majorized by $B$ (written as $A{\prec }^{\mathrm{rs}}B$) if $R\left(A\right)\prec R\left(B\right)$, where $R\left(A\right)$ is the row sum vector of $A$ and $\prec$ is the classical majorization on ${ℝ}^n$. In the present paper, the structure of all linear operators $T:{𝕄}_{n,m}\to {𝕄}_{n,m}$ preserving or strongly preserving row-sum majorization is characterized. Also we consider the concepts of even and circulant majorization on ${ℝ}^n$ and then find the linear preservers of row-sum majorization of these relations on ${𝕄}_{n,m}$. ...

Let $G_1$ and $G_2$ be two given graphs. The Ramsey number $R(G_1,G_2)$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_1$ or $\overline{G}$ contains a $G_2$. Parsons gave a recursive formula to determine the values of $R(P_n,K_{1,m})$, where $P_n$ is a path on $n$ vertices and $K_{1,m}$ is a star on $m+1$ vertices. In this note, we study the Ramsey numbers $R(P_n,K_1\vee F_m)$, where $F_m$ is a linear forest on $m$ vertices. We determine the exact values of $R(P_n,K_1\vee F_m)$ for the cases $m\le n$ and $m\ge 2n$, and for the case that $F_m$ has no odd component. Moreover, we...