相关论文: Embedding $FD(\omega)$ into $\mathcal{P}_s$ densel…

A method is introduced for constructing lattice discretizations of large classes of integrable quantum field theories. The method proceeds in two steps: The quantum algebraic structure underlying the integrability of the model is determined…

Let $G = (V,E)$ be an undirected graph with maximum degree $\Delta$ and vertex conductance $\Psi^*(G)$. We show that there exists a symmetric, stochastic matrix $P$, with off-diagonal entries supported on $E$, whose spectral gap…

In this article, we will show the existence of lattice packings in a sparse family of dimensions. This construction will be a generalisation of Venkatesh's lattice packing result. In our construction, we replace the appearance of the…

We consider a lattice gas in spaces of dimensionality $\mathcal{D}=1,2,3$. The particles are subject to a hardcore exclusion interaction and an attractive pair interaction that satisfies Gauss' law as do Newtonian gravity in…

Using an obstruction based on Donaldson's theorem, we derive strong restrictions on when a Seifert fibered space $Y = F(e; \frac{p_1}{q_1}, \ldots, \frac{p_k}{q_k})$ over an orientable base surface $F$ can smoothly embed in $S^4$. This…

The fourth-order PDE that models the density variation of smectic A liquid crystals presents unique challenges in its (numerical) analysis beyond more common fourth-order operators, such as the classical biharmonic. While the operator is…

For a finite lattice $L$, let Gm($L$) denote the least $n$ such that $L$ can be generated by $n$ elements. For integers $r>2$ and $k>1$, denote by FD$(r)^k$ the $k$-th direct power of the free distributive lattice FD($r$) on $r$ generators.…

Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…

We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…

A modification of the implicit algorithm for particle-in-cell simulations proposed by Petrov and Davis [2011] is presented. The original lattice arrangement is not inherently divergence-free, possibly leading to unphysical results. This…

We study a generalization of the Erd\H{o}s-Falconer distance problem over finite fields. For a graph $G$, two embeddings $p, p': V(G) \to \mathbb{F}_q^d$ of a graph $G$ are congruent if for all edges $(v_i, v_j)$ of $G$ we have that…

A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…

We show that every group $H$ of at most exponential growth with respect to some left invariant metric admits a bi-Lipschitz embedding into a finitely generated group $G$ such that $G$ is amenable (respectively, solvable, satisfies a…

This paper explores the embedding of lattice structures $L \subseteq \mathbb{R}^n$ into smooth manifolds $M \subseteq \mathbb{R}^n$ through a rigorous mathematical framework. Building upon the foundational results established in "Embedding…

Following G. Gr\"atzer and E. Knapp (2007), a slim semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_3$ as a sublattice. An SPS lattice is a slim rectangular lattice if it has exactly two doubly…

A lattice model of critical dense polymers is solved exactly on a cylinder with finite circumference. The model is the first member LM(1,2) of the Yang-Baxter integrable series of logarithmic minimal models. The cylinder topology allows for…

A \emph{proportionally dense subgraph} (PDS) is an induced subgraph of a graph with the property that each vertex in the PDS is adjacent to proportionally as many vertices in the subgraph as in the rest of the graph. In this paper, we study…

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…

We compute the $p$-adic densities of points with a given splitting type along a (generically) finite map, analogous to the classical Chebotarev theorem over number fields and function fields. Under some mild hypotheses, we prove that these…

A theorem of R\"odl states that for every fixed $F$ and $\varepsilon>0$ there is $\delta=\delta_F(\varepsilon)$ so that every induced $F$-free graph contains a vertex set of size $\delta n$ whose edge density is either at most $\varepsilon$…