Some open problems in combinatorics of words and related areas (Algebraic Systems, Formal Languages and Computations) 来自 ResearchGate 喜欢 0 阅读量: 12 作者: J Karhumäki 摘要: We discuss several open problems in combinatorics of words and related areas. The problems fall into six different ...
We survey recent research bridging algebraic geometry, commutative algebra and combinatorics, highlighting open questions, problems and conjectures of current interest. For expositional simplicity and focus, the emphasis is on homogeneous ideals of fat point subschemes of projective space. The survey is ...
Abstract We present 35 open problems on combinatorial, geometric and algebraic aspects of k-orbit abstract polytopes. We also present a theory of rooted polytopes that has appeared implicitly in previous work but has not been formalized before....
combinatoricsWe discuss some combinatorial and algebraic problems which have arisen from the study of the nonlinear Schru00f6dinger equation. In particular we discuss a combinatorial graph, which we call energy graph associated to a Cayley graph. Some important features of normal forms are hidden ...
Many problems in analysis (as well as adjacent fields such as combinatorics, theoretical computer science, and PDE) are interested in the order of growth (or decay) of some quantity that depends on one or more asymptotic parameters (such as )– for instance, whether the quantity grows or dec...
In order to make the problem of evaluating the functions fd(n) and ld(n) more tractable, we consider both problems in the special case, where the connected components are restricted to d-dimensional open balls. We denote the corresponding maximum volumes by fd∘(n) and ld∘(n) respecti...
problems via new swarm intelligent algorithms 42:45 Statistical Network Models for Integrating Functional Connectivity with sMRI and 59:08 The Tumor Growth Paradox 46:37 A case study on stochastic games on large graphs in mean field and sparse regime 48:17 Differential Equations and Algebraic ...
Besides the binary string problem mentioned above, there are a number of equivalent problems in mathemat- ics. In graph theory, a matching in a graph is a set of edges without common vertices26. That edge set corresponds to the double bonds in fatty acids because the latter must not be ...
the analysis of dynamic processes (e.g., random walks) occurring on the graph, as well as in the investigation of the dynamical properties of connected structures themselves (e.g., vibrational structures and relaxation modes), this result allows addressing analytically a large class of problems....
This is a survey of lattice point methods for binomial ideals. It is aimed at students and researchers in algebra; it includes many examples, open problems, and elementary introductions to the motivations and background from outside of algebra. ...