相关论文: The baker's map with a convex hole

There are many instances such that deformation space of the homology class of an algebraic cycle as a Hodge cycle is larger than its deformation space as algebraic cycle. This phenomena can occur for algebraic cycles inside hypersurfaces,…

We construct certain non-degenerate maps and sets, mainly in the complex-analytic category. For example, we show that for every countable subset S in an irreducible complex space X there exists a holomorphic map from the unit disk to X such…

Piecewise-linear maps describe dynamical phenomena that switch between distinct states and readily generate complex bifurcation structures due to their strong nonlinearity. We show that two-dimensional continuous piecewise-linear maps near…

We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…

A completely entangled subspace of a tensor product of Hilbert spaces is a subspace with no non-trivial product vector. K. R. Parthasarathy determined the maximum dimension possible for such a subspace. Here we present a simple explicit…

Let $D$ be an orientation of a simple graph. Given $u,v\in V(D)$, a directed shortest $(u,v)$-path is a $(u,v)$-geodesic. $S \subseteq V(D)$ is convex if, for every $u,v \in S$, the vertices in each $(u,v)$-geodesic and in each…

A geometric characterization is given for invertible quantum measurement maps. Denote by ${\mathcal S}(H)$ the convex set of all states (i.e., trace-1 positive operators) on Hilbert space $H$ with dim$H\leq \infty$, and $[\rho_1, \rho_2]$…

Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…

An algebra extension A | B is right depth two if its tensor-square A\otimes_B A is in the Dress category Add A as A-B-bimodules. We consider necessary conditions for right, similarly left, D2 extensions in terms of partial A-invariance of…

The NP-hard Distinct Vectors problem asks to delete as many columns as possible from a matrix such that all rows in the resulting matrix are still pairwise distinct. Our main result is that, for binary matrices, there is a complexity…

One way to certify that a graph does not contain an induced cycle of length six is to provide a partition of its vertex set into (i) a stable set, and (ii) a graph containing no stable set of size three and no induced matching of size two.…

Let $G$ be a group and $S$ be the set of all non-trivial proper subgroups of $G$. The intersection hypergraph of $G$, denoted by $\tilde{\Gamma}_\mathcal{H}(G)$, is a hypergraph whose vertex set is $\{H \in S \,\, | \,\, H \cap K = \{e\}…

We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…

Given a graph $G$, the Hadwiger number of $G$, denoted by $h(G)$, is the largest integer $k$ such that $G$ contains the complete graph $K_k$ as a minor. A hole in $G$ is an induced cycle of length at least four. Hadwiger's Conjecture from…

High dimensional expanders (HDXs) are a hypergraph generalization of expander graphs. They are extensively studied in the math and TCS communities due to their many applications. Like expander graphs, HDXs are especially interesting for…

We study a general family of problems that form a common generalization of classic hitting (also referred to as covering or transversal) and packing problems. An instance of X-HitPack asks: Can removing k (deletable) vertices of a graph G…

Let $X$ be a general complete intersection of a given multi-degree in a complex projective space. Suppose that the anti-canonical line bundle of $X$ is ample. Using the cylinder homomorphism associated with the family of complete…

We study the vertices of the polytopes of all affine maps (a.k.a. hom-polytopes) between higher dimensional simplices, cubes, and crosspolytopes. Systematic study of general hom-polytopes was initiated in [3]. The study of such vertices is…

The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for undirected (partially) reflexive graphs. We introduce…

A Heffter array $H(m,n;s,t)$ is an $m \times n$ matrix with nonzero entries from $\mathbb{Z}_{2ms+1}$ such that $i)$ each row contains $s$ filled cells and each column contains $t$ filled cells, $ii)$ every row and column sum to 0, and…