English
Related papers

Related papers: Simplicial shells and thickness in the partition g…

200 papers

We investigate a fundamental question regarding a benchmark class of shapes in one of the simplest, yet most widely utilized abstract models of algorithmic tile self-assembly. Specifically, we study the directed tile complexity of a $k…

Data Structures and Algorithms · Computer Science 2020-07-23 David Furcy , Scott M. Summers , Logan Withers

I investigate a discrete model of quantum gravity on a causal null-lattice with \SLC structure group. The description is geometric and foliates in a causal and physically transparent manner. The general observables of this model are…

General Relativity and Quantum Cosmology · Physics 2023-04-04 Martin Schaden

We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…

Combinatorics · Mathematics 2011-10-05 Thomas Enkosky , Jeremy L. Martin

Let $S = \mathbb{C}[x_{i,j}]$ be the ring of polynomial functions on the space of $m \times n$ matrices, and consider the action of the group $\mathbf{GL} = \mathbf{GL}_m \times \mathbf{GL}_n$ via row and column operations on the matrix…

Commutative Algebra · Mathematics 2020-08-07 Hang Huang

A group invariant for links in thickened closed orientable surfaces is studied. Associated polynomial invariants are defined. The group detects nontriviality of a virtual link and determines its virtual genus.

Geometric Topology · Mathematics 2014-10-01 J. Scott Carter , Daniel S. Silver , Susan G. Williams

Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erd\"os-R\'enyi G(N, p) random graph. We use Maximum Clique to explore the structure of the problem as a function of…

Disordered Systems and Neural Networks · Physics 2023-05-26 Raffaele Marino , Scott Kirkpatrick

We study the realizability of simplicial complexes with a given pair of integer sequences, representing the node degree distribution and the facet size distribution, respectively. While the $s$-uniform variant of the problem is…

Social and Information Networks · Computer Science 2021-10-29 Tzu-Chi Yen

We investigate the collapsibility of systolic finite simplicial complexes of arbitrary dimension. The main tool we use in the proof is discrete Morse theory. We shall consider a convex subcomplex of the complex and project any simplex of…

Combinatorics · Mathematics 2014-03-19 Djordje Baralic , Ioana-Claudia Lazar

We perform numerical simulations of purely repulsive soft colloidal particles interacting via a generalized elastic potential and constrained to a two-dimensional plane and to the surface of a spherical shell. For the planar case, we…

Soft Condensed Matter · Physics 2011-06-16 William L. Miller , Angelo Cacciuto

For a Riemannian manifold $(N,g)$, we construct a scalar flat metric $G$ in the tangent bundle $TN$. It is locally conformally flat if and only if either, $N$ is a 2-dimensional manifold or, $(N,g)$ is a real space form. It is also shown…

Differential Geometry · Mathematics 2023-09-20 Nikos Georgiou , Brendan Guilfoyle

We study the moduli of G-local systems on smooth but not necessarily proper complex algebraic varieties. We show that, when suitably considered as derived algebraic stacks, they carry natural Poisson structures, generalizing the well known…

Algebraic Geometry · Mathematics 2019-07-30 Tony Pantev , Bertrand Toen

We show how to find a complete set of necessary and sufficient conditions that solve the fixed-parameter local congruence problem of immersions in $G$-spaces, whether homogeneous or not, provided that a certain $k^{\rm th}$ order jet bundle…

Differential Geometry · Mathematics 2013-04-30 Jeongoo Cheh

The clique graph $kG$ of a graph $G$ has as its vertices the cliques (maximal complete subgraphs) of $G$, two of which are adjacent in $kG$ if they have non-empty intersection in $G$. We say that $G$ is clique convergent if $k^nG\cong k^m…

Combinatorics · Mathematics 2025-01-03 Anna M. Limbach , Martin Winter

Let $n\geq 2$ be an integer, $p$ be a prime number and $K$ be a finite extension of $\mathbb{Q}_p$. Motivated by Schraen's thesis and Gehrmann's definition of automorphic simple $\mathscr{L}$-invariants, we study the first non-vanishing…

Number Theory · Mathematics 2026-01-01 Zicheng Qian

An n-simplex is said to be n-well-centered if its circumcenter lies in its interior. We introduce several other geometric conditions and an algebraic condition that can be used to determine whether a simplex is n-well-centered. These…

Computational Geometry · Computer Science 2009-12-17 Evan VanderZee , Anil N. Hirani , Damrong Guoy , Vadim Zharnitsky , Edgar Ramos

With a better understanding of the loss surfaces for multilayer networks, we can build more robust and accurate training procedures. Recently it was discovered that independently trained SGD solutions can be connected along one-dimensional…

Machine Learning · Computer Science 2021-11-17 Gregory W. Benton , Wesley J. Maddox , Sanae Lotfi , Andrew Gordon Wilson

For the structure of the thin electrical double layer~(EDL) and the property related to the EDL capacitance, we analyze boundary layer solutions (corresponding to the electrostatic potential) of a non-local elliptic equation which is a…

Analysis of PDEs · Mathematics 2018-07-31 Chiun-Chang Lee

Fix a field $k$. When $\Delta$ is a simplicial complex on $n$ vertices with Stanley-Reisner ideal $I_\Delta$, we define and study an invariant called the $\textit{type defect}$ of $\Delta$. Except when $\Delta$ is of a single simplex, the…

Commutative Algebra · Mathematics 2019-01-30 Hailong Dao , Jay Schweig

The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…

Algebraic Topology · Mathematics 2025-09-10 Matthew Burfitt , Jie Wu , Stephen S. -T. Yau , Shing-Tung Yau

We study combinatorial and algebraic properties of $t$-clique-free complexes, a family of simplicial complexes associated with finite simple graphs that generalize the classical independence complex. For a graph $G$ and an integer $t \ge…

Combinatorics · Mathematics 2026-02-11 Rakesh Ghosh , S Selvaraja
‹ Prev 1 4 5 6 7 8 10 Next ›